Level 6

Trees

Previous Next
  • 1. Introduction to trees
  • 2. Binary Tree
  • 3. Binary Search Tree
  • 4. Implementation of BSTs
Traversal
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:06
Symmetric Binary Tree 300 17:02
Bst traversal
Problem Score Companies Time Status
Kth Smallest Element In Tree 300 23:22
2-Sum Binary Tree 400 47:47
BST Iterator 500 28:48
Recover Binary Search Tree 750
45:24
Inplace change
Problem Score Companies Time Status
Invert the Binary Tree 300
10:14
Level order
Problem Score Companies Time Status
ZigZag Level Order Traversal BT 350 32:06
Populate Next Right Pointers Tree 900 35:03
Root to leaf
Trie
Problem Score Companies Time Status
Shortest Unique Prefix 350
60:03
Tree search
Problem Score Companies Time Status
Least Common Ancestor 450 45:33
Linkedlist tree
Problem Score Companies Time Status
Flatten Binary Tree to Linked List 500 31:18
Interval tree
Problem Score Companies Time Status
Order of People Heights 700
71:06
Click here to jump start your coding interview preparation