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 60:41
Inorder Traversal 350 26:33
Postorder Traversal 350 23:29
Preorder Traversal 350 11:57
Tries
Problem Score Companies Time Status
Hotel Reviews 200 64:26
Simple tree ops
Problem Score Companies Time Status
Balanced Binary Tree 275 24:30
2 trees
Problem Score Companies Time Status
Identical Binary Trees 300 9:57
Symmetric Binary Tree 300 17:57
Bst traversal
Problem Score Companies Time Status
Kth Smallest Element In Tree 300 23:10
2-Sum Binary Tree 400 47:52
BST Iterator 500 30:33
Recover Binary Search Tree 750
46:07
Inplace change
Problem Score Companies Time Status
Invert the Binary Tree 300
10:31
Level order
Problem Score Companies Time Status
ZigZag Level Order Traversal BT 350 34:08
Populate Next Right Pointers Tree 900 37:10
Root to leaf
Trie
Problem Score Companies Time Status
Shortest Unique Prefix 350
58:32
Tree search
Problem Score Companies Time Status
Least Common Ancestor 450 47:03
Linkedlist tree
Problem Score Companies Time Status
Flatten Binary Tree to Linked List 500 33:14
Interval tree
Problem Score Companies Time Status
Order of People Heights 700
68:13
Click here to start solving coding interview questions