Binary Trees | Binary Search Trees | C++ | Java | Data Structures and Algorithms | Placements
4.0
(2)
14 learners
What you'll learn
This course includes
- 10.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 54 lessons • 10.5 hours of video
Binary Trees | Binary Search Trees | C++ | Java | Data Structures and Algorithms | Placements
54 lessons
• 10.5 hours
Binary Trees | Binary Search Trees | C++ | Java | Data Structures and Algorithms | Placements
54 lessons
• 10.5 hours
- L1. Introduction to Trees | Types of Trees 09:50
- L2. Binary Tree Representation in C++ 04:43
- L3. Binary Tree Representation in Java 04:12
- L4. Binary Tree Traversals in Binary Tree | BFS | DFS 09:59
- L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation 07:29
- L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation 07:07
- L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation 05:31
- L8. Level Order Traversal of Binary Tree | BFS | C++ | Java 08:57
- L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack 06:50
- L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack 11:14
- L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree 04:09
- L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees 12:33
- L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees 10:57
- L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java 08:05
- L15. Check for Balanced Binary Tree | C++ | Java 12:30
- L16. Diameter of Binary Tree | C++ | Java 13:47
- L17. Maximum Path Sum in Binary Tree | C++ | Java 17:50
- L18. Check it two trees are Identical or Not | C++ | Java 04:18
- L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java 08:21
- L20. Boundary Traversal in Binary Tree | C++ | Java 09:47
- L21. Vertical Order Traversal of Binary Tree | C++ | Java 18:53
- L22. Top View of Binary Tree | C++ | Java 10:30
- L23. Bottom View of Binary Tree | C++ | Java 13:13
- L24. Right/Left View of Binary Tree | C++ | Java 13:28
- L25. Check for Symmetrical Binary Trees | C++ | Java 09:20
- L26. Print Root to Node Path in Binary Tree | C++ | Java 11:00
- L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java 14:09
- L28. Maximum Width of Binary Tree | C++ | Java 22:41
- L29. Children Sum Property in Binary Tree | O(N) Approach | C++ | Java 16:13
- L30. Print all the Nodes at a distance of K in Binary Tree | C++ | Java 17:42
- L31. Minimum time taken to BURN the Binary Tree from a Node | C++ | Java 18:24
- L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java 16:13
- L33. Requirements needed to construct a Unique Binary Tree | Theory 08:41
- L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java 18:52
- L35. Construct the Binary Tree from Postorder and Inorder Traversal | C++ | Java 19:46
- L36. Serialize and De-serialize Binary Tree | C++ | Java 17:18
- L37. Morris Traversal | Preorder | Inorder | C++ | Java 23:50
- L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java 21:51
- L39. Introduction to Binary Search Tree | BST 08:54
- L40. Search in a Binary Search Tree | BST | C++ | Java 06:33
- L41. Ceil in a Binary Search Tree | BST | C++ | Java 05:36
- L42. Floor in a Binary Search Tree | BST | C++ | Java 05:00
- L43. Insert a given Node in Binary Search Tree | BST | C++ | Java 08:18
- L44. Delete a Node in Binary Search Tree | BST | C++ | Java 15:48
- L45. K-th Smallest/Largest Element in BST 08:27
- L46. Check if a tree is a BST or BT | Validate a BST 09:39
- L47. LCA in Binary Search Tree 08:06
- L48. Construct a BST from a preorder traversal | 3 Methods 16:32
- L49. Inorder Successor/Predecessor in BST | 3 Methods 10:47
- L50. Binary Search Tree Iterator | BST | O(H) Space 14:00
- L51. Two Sum In BST | Check if there exists a pair with Sum K 15:06
- L52. Recover BST | Correct BST with two nodes swapped 15:56
- L53. Largest BST in Binary Tree 17:27
- Announcing the FREE ka TREE SERIES #shorts 00:16
Take this course with you
Download the app to continue lessons from your phone anytime.
