![[DS 42] Calculating Binary Tree height, Number of nodes, internal nodes, leaf nodes, & mirror image](https://thaitubemp3.com/image/I_VBS3SW4nw.webp)
[DS 42] Calculating Binary Tree height, Number of nodes, internal nodes, leaf nodes, & mirror image
Calculating Binary Tree height, Number of nodes, internal nodes, leaf nodes, & mirror image 1. Data structure Course structure: • [DS 1] Data structure: Course structure 2. Linked list basics (Part 1): • [DS 2] Linked list basics (Part 1) 3. Singly linked list (opeations) using C program (part 1): • [DS 3] Singly linked list (operations) usi... 4 4. Singly linked list using C (Part 2): • [DS 4] Singly linked list using C (Part 2) 4 5. Circular linked list using C language: • Video 6. Doubly linked list with C Program: • Video 4 7. Stack: PUSH and POP operation with C Program: • Video 8. Infix to postfix and evaluation of postfix expression with C Program: • [DS 8] Infix to postfix and evaluation of ... 9. Queue data structure. Enqueue(x), Dequeue(), applications with C Program: • [DS 9] Queue data structure. Enqueue(x), D... 10. Circular queue: enqueue(x) and dequeue() operations with C Program: • Video 11. Recursion Part 1 with C Program: • Video 4 12. Towers of Hanoi (Recursion part 2) using C program: • Video 13. Tree data structure: • [DS 13] Tree data structure, Basics, Termi... 14. Binary search tree (BST). Insert data into BST with C Program: • Video 15. BST Traversing (Pre, In, Post) order traversing with C Program: • [DS 15] BST Traversing (Pre, In, Post) ord... 16. Binary search tree. Min max search traversing using C Language: • [DS 16] Binary search tree. Min max search... 17. Binary Search Tree (Node deletion): • [DS 17] Node deletion from Binary Search T... 18. AVL Tree: • [DS 18] AVL Tree: Properties & insertion o... 19. AVL Tree node delete : • [DS 19] AVL Tree node delete 20. Threaded Binary Tree : • [DS 20] Threaded Binary Tree with simple a... 21. Heap Tree: Types, max-heapify, convert into max heap and heap sort: • [DS 21] Heap Tree: Types, max-heapify, con... 22. Heap Tree (Part 2) Display max, delete max (root) data and display heap: • [DS 22] Heap Tree (Part 2) Display max, de... 23. Searching: Sequential and binary search with C Program: • Video 24. Hashing: Hash functions, hash collisions, collision resolution with C Program: • [DS 24] Hashing: Hash functions, hash coll... 25. Bubble sort with C Program: • [DS 25] Bubble sort with C Program 26. Selection Sort with C Program: • [DS 26] Selection Sort with C Program 27. Insertion Sort with C Program : • [DS 27] Insertion Sort with C Program 28. Quick Sort with C Program: • [DS 28] Quick Sort with C Program 29. Merge Sort with C Programming : • [DS 29] Merge Sort with C Programming 30. Radix Sort: • [DS 30] Radix Sort with simple example 31. Cocktail Sort: • [DS 31] Cocktail Sort with simple example 32. Bucket Sort: • [DS 32] Bucket Sort with simple example 33. Counting Sort : • [DS 33] Counting Sort with simple example 34. Shell Sort: • [DS 34] Shell Sort with simple example 35. Tree selection sort using Tournament tree: • [DS 35] Tree selection sort using Tourname... 36. Sorting Summary: • [DS 36] Sorting Summary 37. set basic, set representations, set operations: • [DS 37] Set basic, set representations, se... 38. set using linked list and set operation: • [DS 38] Set using linked list and set oper... 4 39. set, set using hashing and bit vector, and list operations: • [DS 39] Set, set using hashing and bit vec... 4 40. set and set operations using tree : • [DS 40] Set and set operations using tree ... 41. Interpolation Search with C Program: • [DS 41] Interpolation Search with C Program 42. Binary tree height, number of nodes, internal, leaf nodes, construct mirror image: • Video 43. Graph basics: • [DS 43] Graph basics: various terminology ... 44. Graph representation. set, adjacency matrix and adjacency list: • [DS 44] Graph representation. set, adjacen... 4 45. Operations on graphs (node insertion, deletion, merging): • [DS 45] Operations on graphs (node inserti... 46. B Tree: • [DS 46] B Tree with simple and proper example
