Don't watch my A2Z DSA Course

How to setup VS code for DSA and CP | Input / Output split format

C++ Basics in One Shot - Strivers A2Z DSA Course - L1

Time and Space Complexity - Strivers A2Z DSA Course

Complete C++ STL in 1 Video | Time Complexity and Notes

Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course

Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course

Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course

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

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