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:25
Inorder Traversal 350 25:57
Postorder Traversal 350 22:40
Preorder Traversal 350 11:39
Tries
Problem Score Companies Time Status
Hotel Reviews 200 65:30
Simple tree ops
Problem Score Companies Time Status
Balanced Binary Tree 275 24:05
2 trees
Problem Score Companies Time Status
Identical Binary Trees 300 9:44
Symmetric Binary Tree 300 17:21
Bst traversal
Problem Score Companies Time Status
Kth Smallest Element In Tree 300 22:55
2-Sum Binary Tree 400 47:51
BST Iterator 500 29:44
Recover Binary Search Tree 750
46:04
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 33:13
Populate Next Right Pointers Tree 900 36:13
Root to leaf
Trie
Problem Score Companies Time Status
Shortest Unique Prefix 350
58:40
Tree search
Problem Score Companies Time Status
Least Common Ancestor 450 46:11
Linkedlist tree
Problem Score Companies Time Status
Flatten Binary Tree to Linked List 500 32:00
Interval tree
Problem Score Companies Time Status
Order of People Heights 700
68:31
Click here to start solving coding interview questions