Section 12: Binary Tree

📚 Vanakkam DSA Course (24 sections) · Hope AI — ML & DS Course

Lessons

#	Lesson Name	Duration	Notes
1	Intro to Trees	29m 2s
2	Binary Tree Traversals Explained	34m 32s
3	Preorder Traversal - Recursive	41m 3s
4	Inorder & PostOrder - Recursive	13m 34s
5	Preorder Traversal - Iterative	35m 33s
6	Inorder Traversal - Iterative	32m 47s
7	Postorder - Iterative 2 Stacks	32m 55s
8	Postorder - Iterative One Stack	51m 21s
9	DFS and BFS	27m 6s
10	Level Order Traversal - Queue	32m+
11	Maximum Depth	-
12	Path Sum	-
13	Symmetric Tree	-
14	Invert Binary Tree	-
15	Same Tree	-
16	Balanced Binary Tree	-
17	Diameter	-
18	Zigzag Level Order	-
19	Subtree	-
20	LCA	-
21	Right Side View	-
22	Count Good Nodes	-
23	Populating Next Right Pointers	-
24	Binary Tree Maximum Path Sum	-

Progress Checklist

• [ ] Intro to Trees
• [ ] Binary Tree Traversals Explained
• [ ] Preorder Traversal - Recursive
• [ ] Inorder & PostOrder - Recursive
• [ ] Preorder Traversal - Iterative
• [ ] Inorder Traversal - Iterative
• [ ] Postorder - Iterative 2 Stacks
• [ ] Postorder - Iterative One Stack
• [ ] DFS and BFS
• [ ] Level Order Traversal - Queue
• [ ] Maximum Depth
• [ ] Path Sum
• [ ] Symmetric Tree
• [ ] Invert Binary Tree
• [ ] Same Tree
• [ ] Balanced Binary Tree
• [ ] Diameter
• [ ] Zigzag Level Order
• [ ] Subtree
• [ ] LCA
• [ ] Right Side View
• [ ] Count Good Nodes
• [ ] Populating Next Right Pointers
• [ ] Binary Tree Maximum Path Sum

My Notes

Add your notes here as you progress through the section...