# | Status | Problem | video | Level | Completes | Likes |
---|---|---|---|---|---|---|
40 |
|
In a Binary Tree, Create Linked Lists of all the nodes at each depth |
Hard | % | 0 | |
39 |
|
Level Order Traversal, Print each level in separate line |
Medium | % | 0 | |
38 |
|
Determining Binary Tree Balance |
Medium | % | 0 | |
37 |
|
Get the Height of a Node in a Binary Tree |
Medium | % | 0 | |
36 |
|
Find the Maximum Depth OR Height of a Binary Tree |
Beginner | % | 1 | |
32 |
|
Binary Search Tree (BST) Complete Implementation. |
Beginner | % | 0 |