Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

Courses › DSA

Striver Tree Series

By take U forward · English · Intermediate

Binary trees and BST — traversals, views, LCA, construction and interview problems.

A free YouTube playlist, organised on Codify: your progress is saved, you can take timestamped notes and practise in the code editor under every video. All videos belong to their creator.

What this course covers (54 videos)

  1. L1. Introduction to Trees | Types of Trees (9:50)
  2. L2. Binary Tree Representation in C++ (4:43)
  3. L3. Binary Tree Representation in Java (4:12)
  4. L4. Binary Tree Traversals in Binary Tree | BFS | DFS (9:59)
  5. L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation (7:29)
  6. L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation (7:07)
  7. L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation (5:31)
  8. L8. Level Order Traversal of Binary Tree | BFS | C++ | Java (8:57)
  9. L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack (6:50)
  10. L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack (11:14)
  11. L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree (4:09)
  12. L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees (12:33)
  13. L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees (10:57)
  14. L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java (8:05)
  15. L15. Check for Balanced Binary Tree | C++ | Java (12:30)
  16. L16. Diameter of Binary Tree | C++ | Java (13:47)
  17. L17. Maximum Path Sum in Binary Tree | C++ | Java (17:50)
  18. L18. Check it two trees are Identical or Not | C++ | Java (4:18)
  19. L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java (8:21)
  20. L20. Boundary Traversal in Binary Tree | C++ | Java (9:47)
  21. L21. Vertical Order Traversal of Binary Tree | C++ | Java (18:53)
  22. L22. Top View of Binary Tree | C++ | Java (10:30)
  23. L23. Bottom View of Binary Tree | C++ | Java (13:13)
  24. L24. Right/Left View of Binary Tree | C++ | Java (13:28)
  25. L25. Check for Symmetrical Binary Trees | C++ | Java (9:20)
  26. L26. Print Root to Node Path in Binary Tree | C++ | Java (11:00)
  27. L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java (14:09)
  28. L28. Maximum Width of Binary Tree | C++ | Java (22:41)
  29. L29. Children Sum Property in Binary Tree | O(N) Approach | C++ | Java (16:13)
  30. L30. Print all the Nodes at a distance of K in Binary Tree | C++ | Java (17:42)
  31. L31. Minimum time taken to BURN the Binary Tree from a Node | C++ | Java (18:24)
  32. L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java (16:13)
  33. L33. Requirements needed to construct a Unique Binary Tree | Theory (8:41)
  34. L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java (18:52)
  35. L35. Construct the Binary Tree from Postorder and Inorder Traversal | C++ | Java (19:46)
  36. L36. Serialize and De-serialize Binary Tree | C++ | Java (17:18)
  37. L37. Morris Traversal | Preorder | Inorder | C++ | Java (23:50)
  38. L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java (21:51)
  39. L39. Introduction to Binary Search Tree | BST (8:54)
  40. L40. Search in a Binary Search Tree | BST | C++ | Java (6:33)
  41. L41. Ceil in a Binary Search Tree | BST | C++ | Java (5:36)
  42. L42. Floor in a Binary Search Tree | BST | C++ | Java (5:00)
  43. L43. Insert a given Node in Binary Search Tree | BST | C++ | Java (8:18)
  44. L44. Delete a Node in Binary Search Tree | BST | C++ | Java (15:48)
  45. L45. K-th Smallest/Largest Element in BST (8:27)
  46. L46. Check if a tree is a BST or BT | Validate a BST (9:39)
  47. L47. LCA in Binary Search Tree (8:06)
  48. L48. Construct a BST from a preorder traversal | 3 Methods (16:32)
  49. L49. Inorder Successor/Predecessor in BST | 3 Methods (10:47)
  50. L50. Binary Search Tree Iterator | BST | O(H) Space (14:00)
  51. L51. Two Sum In BST | Check if there exists a pair with Sum K (15:06)
  52. L52. Recover BST | Correct BST with two nodes swapped (15:56)
  53. L53. Largest BST in Binary Tree (17:27)
  54. VERY HARD Mock Coding Interview with STRIVER, YouTuber, Googler @take U forward @Striver!! (1:01:33)

More DSA courses