playlistduration

Binary Trees | Binary Search Trees | C++ | Java | Data Structures and Algorithms | Placements

by take U forward · 54 videos

Total watch time

10h 37m

at 1× speed · exactly 10 hours, 36 minutes, 38 seconds at 1×

1×10h 36m 38s
1.25×8h 29m 18s
1.5×7h 4m 25s
1.75×6h 3m 47s
2×5h 18m 19s
Average video11m 47s
Longest23m 50s
Shortest16s
Compare Open on YouTube JSON

Plan to finish

About 11 days at an hour a day

Pick a daily pace and the days you'll watch. Ticked videos are skipped.

Days

At one hour a day, every day, this playlist takes about 11 days. Turn on JavaScript to plan around your week.

Videos (54)

10h 37m in total · tick what you've watched

Tick videos you've watched — progress is saved in this browser.

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

Embed a badge

Show the watch time in a README or course description — it links back here and updates itself

Watch time: 10h 37m · 54 videos

Markdown
[![Watch time: 10h 37m · 54 videos](https://playlistduration.com/badge/playlist/PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk.svg)](https://playlistduration.com/playlist/PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk)
HTML
<a href="https://playlistduration.com/playlist/PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk"><img src="https://playlistduration.com/badge/playlist/PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk.svg" alt="Watch time: 10h 37m · 54 videos" width="210" height="20"></a>

Add ?speed=1.5 to the image URL for the time at that speed, ?label=Course to change the left text, or ?style=flat-square for square corners.

Want the numbers themselves? GET https://playlistduration.com/api/v1/playlist/PLgUwDviBIf0q8Hkd7bK2Bpryj2xVJk8Vk returns them as JSON — free, no key. API docs →

Data from the YouTube Data API as of 2026-09-22 (cached). Private or deleted videos are excluded from totals.