Striver's Binary Trees Series: study plan and how long it takes
The take U forward playlist is 54 videos and 10.6 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
54 videos · 10.6 hours · take U forward
The free "Tree Series" from take U forward covers binary trees and binary search trees in 53 short lectures: traversals (recursive and iterative), heights and diameters, views, LCA, tree construction, serialization, Morris traversal and the standard BST problems.
Most videos are 10 to 20 minutes, which makes this one of the easiest DSA playlists to fit into a daily routine.
Who it's for: Anyone preparing for coding interviews who knows recursion and wants to master tree problems.
How long does it take?
The full playlist is 10.6 hours across 54 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 22 days | 15 days | 11 days |
| 1 h a day | 11 days | 8 days | 6 days |
| 2 h a day | 6 days | 4 days | 3 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 2 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–34 · 6h 9m
Day 1 · 58m
- 1Announcing the FREE ka TREE SERIES #shorts1m
- 2L1. Introduction to Trees | Types of Trees10m
- 3L2. Binary Tree Representation in C++5m
- 4L3. Binary Tree Representation in Java4m
- 5L4. Binary Tree Traversals in Binary Tree | BFS | DFS10m
- 6L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation7m
- 7L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation7m
- 8L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation6m
- 9L8. Level Order Traversal of Binary Tree | BFS | C++ | Java9m
Day 2 · 54m
- 10L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack7m
- 11L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack11m
- 12L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree4m
- 13L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees13m
- 14L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees11m
- 15L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java8m
Day 3 · 57m
- 16L15. Check for Balanced Binary Tree | C++ | Java13m
- 17L16. Diameter of Binary Tree | C++ | Java14m
- 18L17. Maximum Path Sum in Binary Tree | C++ | Java18m
- 19L18. Check it two trees are Identical or Not | C++ | Java4m
- 20L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java8m
Day 4 · 52m
- 21L20. Boundary Traversal in Binary Tree | C++ | Java10m
- 22L21. Vertical Order Traversal of Binary Tree | C++ | Java19m
- 23L22. Top View of Binary Tree | C++ | Java11m
- 24L23. Bottom View of Binary Tree | C++ | Java13m
Day 5 · 48m
- 25L24. Right/Left View of Binary Tree | C++ | Java13m
- 26L25. Check for Symmetrical Binary Trees | C++ | Java9m
- 27L26. Print Root to Node Path in Binary Tree | C++ | Java11m
- 28L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java14m
Day 6 · 57m
- 29L28. Maximum Width of Binary Tree | C++ | Java23m
- 30L29. Children Sum Property in Binary Tree | O(N) Approach | C++ | Java16m
- 31L30. Print all the Nodes at a distance of K in Binary Tree | C++ | Java18m
Day 7 · 43m
- 32L31. Minimum time taken to BURN the Binary Tree from a Node | C++ | Java18m
- 33L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java16m
- 34L33. Requirements needed to construct a Unique Binary Tree | Theory9m
Week 2Videos 35–54 · 4h 28m
Day 8 · 56m
- 35L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java19m
- 36L35. Construct the Binary Tree from Postorder and Inorder Traversal | C++ | Java20m
- 37L36. Serialize and De-serialize Binary Tree | C++ | Java17m
Day 9 · 55m
- 38L37. Morris Traversal | Preorder | Inorder | C++ | Java24m
- 39L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java22m
- 40L39. Introduction to Binary Search Tree | BST9m
Day 10 · 59m
- 41L40. Search in a Binary Search Tree | BST | C++ | Java7m
- 42L41. Ceil in a Binary Search Tree | BST | C++ | Java6m
- 43L42. Floor in a Binary Search Tree | BST | C++ | Java5m
- 44L43. Insert a given Node in Binary Search Tree | BST | C++ | Java8m
- 45L44. Delete a Node in Binary Search Tree | BST | C++ | Java16m
- 46L45. K-th Smallest/Largest Element in BST8m
- 47L46. Check if a tree is a BST or BT | Validate a BST10m
Day 11 · 49m
- 48L47. LCA in Binary Search Tree8m
- 49L48. Construct a BST from a preorder traversal | 3 Methods17m
- 50L49. Inorder Successor/Predecessor in BST | 3 Methods11m
- 51L50. Binary Search Tree Iterator | BST | O(H) Space14m
Day 12 · 48m
- 52L51. Two Sum In BST | Check if there exists a pair with Sum K15m
- 53L52. Recover BST | Correct BST with two nodes swapped16m
- 54L53. Largest BST in Binary Tree17m
Tips for finishing
- Do the traversal videos (L1 to L13) slowly; nearly every later problem is a traversal with a twist.
- At an hour a day you can finish in under two weeks, which makes it a good sprint before interview season.