Level 6

Trees

Previous Next
  • 1. Introduction to trees
  • 2. Binary Tree
  • 3. Binary Search Tree
  • 4. Implementation of BSTs
Simple tree ops
Problem Score Companies Time Status
Balanced Binary Tree 275 24:01
2 trees
Problem Score Companies Time Status
Identical Binary Trees 300 8:54
Symmetric Binary Tree 300 16:52
Bst traversal
Problem Score Companies Time Status
Kth Smallest Element In Tree 300 23:19
2-Sum Binary Tree 400 47:40
BST Iterator 500 28:55
Recover Binary Search Tree 750
45:09
Inplace change
Problem Score Companies Time Status
Invert the Binary Tree 300
10:16
Level order
Problem Score Companies Time Status
ZigZag Level Order Traversal BT 350 31:54
Populate Next Right Pointers Tree 900 34:16
Traversal
Problem Score Companies Time Status
Inorder Traversal 350 23:50
Postorder Traversal 350 20:43
Preorder Traversal 350 10:40
Root to leaf
Trie
Problem Score Companies Time Status
Shortest Unique Prefix 350
60:40
Tree search
Problem Score Companies Time Status
Least Common Ancestor 450 44:48
Linkedlist tree
Problem Score Companies Time Status
Flatten Binary Tree to Linked List 500 30:45
Interval tree
Problem Score Companies Time Status
Order of People Heights 700
72:19
Click here to jump start your coding interview preparation