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:18
Inorder Traversal 350 27:14
Postorder Traversal 350 24:14
Preorder Traversal 350 12:18
Tries
Problem Score Companies Time Status
Hotel Reviews 200 64:02
Simple tree ops
Problem Score Companies Time Status
Balanced Binary Tree 275 25:01
2 trees
Problem Score Companies Time Status
Identical Binary Trees 300 10:05
Symmetric Binary Tree 300 18:05
Bst traversal
Problem Score Companies Time Status
Kth Smallest Element In Tree 300 24:02
2-Sum Binary Tree 400 48:37
BST Iterator 500 31:21
Recover Binary Search Tree 750
46:13
Inplace change
Problem Score Companies Time Status
Invert the Binary Tree 300
10:48
Level order
Problem Score Companies Time Status
ZigZag Level Order Traversal BT 350 34:45
Populate Next Right Pointers Tree 900 38:10
Root to leaf
Trie
Problem Score Companies Time Status
Shortest Unique Prefix 350
58:08
Tree search
Problem Score Companies Time Status
Least Common Ancestor 450 48:02
Linkedlist tree
Problem Score Companies Time Status
Flatten Binary Tree to Linked List 500 34:08
Interval tree
Problem Score Companies Time Status
Order of People Heights 700
67:45
Click here to start solving coding interview questions