Level 6

Trees

Previous Next
  • 1. Introduction to trees
  • 2. Binary Tree
  • 3. Binary Search Tree
  • 4. Implementation of BSTs
Traversal
Problem Score Companies Time Status
Vertical Order traversal of Binary Tree 200 59:29
Inorder Traversal 350 27:43
Postorder Traversal 350 24:48
Preorder Traversal 350 12:39
Tries
Problem Score Companies Time Status
Hotel Reviews 200 63:55
Simple tree ops
Problem Score Companies Time Status
Balanced Binary Tree 275 25:43
2 trees
Problem Score Companies Time Status
Identical Binary Trees 300 10:15
Symmetric Binary Tree 300 18:26
Bst traversal
Problem Score Companies Time Status
Kth Smallest Element In Tree 300 24:41
2-Sum Binary Tree 400 49:06
BST Iterator 500 32:09
Recover Binary Search Tree 750
46:26
Inplace change
Problem Score Companies Time Status
Invert the Binary Tree 300
10:58
Level order
Problem Score Companies Time Status
ZigZag Level Order Traversal BT 350 35:29
Populate Next Right Pointers Tree 900 39:29
Root to leaf
Trie
Problem Score Companies Time Status
Shortest Unique Prefix 350
58:10
Tree search
Problem Score Companies Time Status
Least Common Ancestor 450 48:51
Linkedlist tree
Problem Score Companies Time Status
Flatten Binary Tree to Linked List 500 34:48
Interval tree
Problem Score Companies Time Status
Order of People Heights 700
67:32
Click here to start solving coding interview questions