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 59:22
Inorder Traversal 350 28:23
Postorder Traversal 350 25:44
Preorder Traversal 350 13:03
Tries
Problem Score Companies Time Status
Hotel Reviews 200 65:16
Simple tree ops
Problem Score Companies Time Status
Balanced Binary Tree 275 26:21
2 trees
Problem Score Companies Time Status
Identical Binary Trees 300 10:25
Symmetric Binary Tree 300 19:00
Bst traversal
Problem Score Companies Time Status
Kth Smallest Element In Tree 300 25:15
2-Sum Binary Tree 400 50:35
BST Iterator 500 32:53
Recover Binary Search Tree 750
46:44
Inplace change
Problem Score Companies Time Status
Invert the Binary Tree 300
11:18
Level order
Problem Score Companies Time Status
ZigZag Level Order Traversal BT 350 36:15
Populate Next Right Pointers Tree 900 40:26
Root to leaf
Trie
Problem Score Companies Time Status
Shortest Unique Prefix 350
58:37
Tree search
Problem Score Companies Time Status
Least Common Ancestor 450 49:39
Linkedlist tree
Problem Score Companies Time Status
Flatten Binary Tree to Linked List 500 35:29
Interval tree
Problem Score Companies Time Status
Order of People Heights 700
66:47