Complete course on Tree - Data Structures
- Description
- Curriculum
- FAQ
- Reviews
Welcome to my crash course on Binary Trees which is one of the pivotal concepts in Advanced Data Structures and Algorithms!
In this course, we’ll learn
1. What is Recursion? (Recursion is a prerequisite and a very useful tools to implement binary Trees)
2. Tricks to write recursive functions!
3. Tracing recursive functions
4. Converting an iterative solution to a recursive solution.
5. Basic Tree terminologies
6. Implementation of Binary Trees using LinkedLists
7. The basic traversal algorithms – How to code them?
8. Finding the height of the Tree – Algorithm, Code, Tracing.
9. How to find the Maximum and Minimum elements of a tree?
10. Finding the sum of all nodes in a tree
11. Level Order Traversal – Using Brute Force Approach and Improved Solution using Queue Data Structure.
12. Printing the left View of a Binary Tree
13. Printing the Right View of a Binary Tree
14. Understanding Hashmaps in C++ STL
15. Implementation of Vertical Order Traversals using Hashmaps
16. Printing all the leaf nodes of a Binary Tree using any one of the Traversal algorithms.
17. Printing the cousin nodes of a node in a Binary Tree.
18. Binary Search Trees – Explanation
Through these standard Tree problems, you’ll easily be familiarized on implementing Trees in C or C++. Some ideas were also provided to implement the same using some other languages using Python too. So, if you’re not comfortable in using C or C++, It’s not a problem 🙂
-
11
8. Pre Order Traversal of Binary Trees -
12
9. Working out the Post Order Traversal of Binary Trees
-
13
10. Working out the Inorder Traversal of Binary Trees
-
14
11. Concrete Implementation of Post Order Traversal in C++
-
15
12. Concrete Implementation of Pre Order Traversal in C++
-
16
13. Concrete Implementation of In Order Traversal in C++
-
17
14. Algorithm to find the height of the tree
-
18
15. Algorithm to find the sum of all the nodes in a tree
-
19
16. Tracing the code to find the sum of all nodes in a tree
-
20
17. Finding the maximum node of a binary tree
-
21
18. Finding the minimum node of a binary tree
-
22
19. Level Order Traversal without using Queue - Brute Force Approach
-
23
20. Deriving LOT using queue algorithm
-
24
21. Coding the Level Order Traversal algorithm using Queues
-
25
22. Left View and Right View of a Tree
-
26
24. Understanding the algorithm to perform Vertical Order Traversal of a Binary
-
27
25. Tracing the algorithm to perform Vertical Order Traversal of a Binary tree
-
28
26. Printing all the leaf nodes of a Binary Tree
-
29
27. Printing the cousins of a node in a Binary Tree
-
30
Introduction to BST
