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 58:43
Inorder Traversal 350 24:52
Postorder Traversal 350 21:49
Preorder Traversal 350 11:17
Tries
Problem Score Companies Time Status
Hotel Reviews 200 65:06
Simple tree ops
Problem Score Companies Time Status
Balanced Binary Tree 275 24:00
2 trees
Problem Score Companies Time Status
Identical Binary Trees 300 9:14
Symmetric Binary Tree 300 17:00
Bst traversal
Problem Score Companies Time Status
Kth Smallest Element In Tree 300 23:09
2-Sum Binary Tree 400 48:07
BST Iterator 500 29:12
Recover Binary Search Tree 750
45:26
Inplace change
Problem Score Companies Time Status
Invert the Binary Tree 300
10:19
Level order
Problem Score Companies Time Status
ZigZag Level Order Traversal BT 350 32:24
Populate Next Right Pointers Tree 900 34:46
Root to leaf
Trie
Problem Score Companies Time Status
Shortest Unique Prefix 350
59:34
Tree search
Problem Score Companies Time Status
Least Common Ancestor 450 45:36
Linkedlist tree
Problem Score Companies Time Status
Flatten Binary Tree to Linked List 500 31:16
Interval tree
Problem Score Companies Time Status
Order of People Heights 700
70:15
Click here to jump start your coding interview preparation