How to DFS in a TREE | Height and Depth of a TREE | CP Course | EP 73
![](https://i.ytimg.com/vi/w2oz11KWNQY/mqdefault.jpg)
12:37
Pre-Computation using DFS | Subtree Queries | CP Course | EP 74
![](https://i.ytimg.com/vi/eD3tmO66aBA/mqdefault.jpg)
8:05
L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java
![](https://i.ytimg.com/vi/9_ftWKch6vI/mqdefault.jpg)
34:39
Depth First Search | DFS : The Only Tutorial You need | CP Course | EP 70
![](https://i.ytimg.com/vi/tZS4VHtbYoo/mqdefault.jpg)
11:50
Minimum Depth of Binary Tree (LeetCode 111) | Full solution w/ graphical examples | Study Algorithms
![](https://i.ytimg.com/vi/PMMc4VsIacU/mqdefault.jpg)
20:52
Depth First Search (DFS) Explained: Algorithm, Examples, and Code
![](https://i.ytimg.com/vi/WOV3LYhPews/mqdefault.jpg)
16:54
How to find Shortest Path using BFS | SPOJ NAKANJ | CP Course | EP 79
![](https://i.ytimg.com/vi/YLObBv1B94Q/mqdefault.jpg)
23:43
3203. Find Minimum Diameter After Merging Two Trees | Diameter of a Tree | Graph
![](https://i.ytimg.com/vi/M8jdDR5kV3k/mqdefault.jpg)
24:01