Library/Binary Trees and Binary Search Trees - DSA

Published

Start Reading Chapter 1

TechnologyData Structures & AlgorithmsYouTube Playlist CourseBeginner

10 hrs 57 mins

53 Chapters

Binary Trees and Binary Search Trees - DSA

By take U forward

Master essential data structures with a deep dive into binary trees and search trees tailored for coding interviews and technical placements. Learn core concepts, recursive and iterative traversal techniques, and algorithm implementations in both C++ and Java.

Table of Contents

Binary Trees and Binary Search Trees - DSA

Table of Contents

L1. Introduction to Trees | Types of Trees

L2. Binary Tree Representation in C++

L3. Binary Tree Representation in Java

L4. Binary Tree Traversals in Binary Tree | BFS | DFS

L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation

L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation

L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation

L8. Level Order Traversal of Binary Tree | BFS | C++ | Java

L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack

L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack

L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree

L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees

L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees

L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java

L15. Check for Balanced Binary Tree | C++ | Java

L16. Diameter of Binary Tree | C++ | Java

L17. Maximum Path Sum in Binary Tree | C++ | Java

L18. Check it two trees are Identical or Not | C++ | Java

L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java

L20. Boundary Traversal in Binary Tree | C++ | Java

L21. Vertical Order Traversal of Binary Tree | C++ | Java

L22. Top View of Binary Tree | C++ | Java

L23. Bottom View of Binary Tree | C++ | Java

L24. Right/Left View of Binary Tree | C++ | Java

L25. Check for Symmetrical Binary Trees | C++ | Java

L26. Print Root to Node Path in Binary Tree | C++ | Java

L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java

L28. Maximum Width of Binary Tree | C++ | Java

L29. Children Sum Property in Binary Tree | O(N) Approach | C++ | Java

L30. Print all the Nodes at a distance of K in Binary Tree | C++ | Java

L31. Minimum time taken to BURN the Binary Tree from a Node | C++ | Java

L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java

L33. Requirements needed to construct a Unique Binary Tree | Theory

L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java

L35. Construct the Binary Tree from Postorder and Inorder Traversal | C++ | Java

L36. Serialize and De-serialize Binary Tree | C++ | Java

L37. Morris Traversal | Preorder | Inorder | C++ | Java

L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java

L39. Introduction to Binary Search Tree | BST

L40. Search in a Binary Search Tree | BST | C++ | Java

L41. Ceil in a Binary Search Tree | BST | C++ | Java

L42. Floor in a Binary Search Tree | BST | C++ | Java

L43. Insert a given Node in Binary Search Tree | BST | C++ | Java

L44. Delete a Node in Binary Search Tree | BST | C++ | Java

L45. K-th Smallest/Largest Element in BST

L46. Check if a tree is a BST or BT | Validate a BST

L47. LCA in Binary Search Tree

L48. Construct a BST from a preorder traversal | 3 Methods

L49. Inorder Successor/Predecessor in BST | 3 Methods

L50. Binary Search Tree Iterator | BST | O(H) Space

L51. Two Sum In BST | Check if there exists a pair with Sum K

L52. Recover BST | Correct BST with two nodes swapped

L53. Largest BST in Binary Tree