Topic Details

11. Tree

Total Problems: 21
1.Maximum Depth of Binary Tree
SLIME (+10XP)
2.Invert Binary Tree
SLIME (+10XP)
3.Diameter of Binary Tree
SLIME (+10XP)
4.Balanced Binary Tree
SLIME (+10XP)
5.Symmetric Tree
SLIME (+10XP)
6.Binary Tree Level Order Traversal
GOBLIN (+20XP)
7.Binary Tree Zigzag Level Order Traversal
GOBLIN (+20XP)
8.Binary Tree Right Side View
GOBLIN (+20XP)
9.Validate Binary Search Tree
GOBLIN (+20XP)
10.Kth Smallest Element in a BST
GOBLIN (+20XP)
11.Lowest Common Ancestor of a Binary Search Tree
GOBLIN (+20XP)
12.Lowest Common Ancestor of a Binary Tree
GOBLIN (+20XP)
13.Construct Binary Tree from Preorder and Inorder Traversal
GOBLIN (+20XP)
14.Flatten Binary Tree to Linked List
GOBLIN (+20XP)
15.Sum Root to Leaf Numbers
GOBLIN (+20XP)
16.Path Sum III
GOBLIN (+20XP)
17.Count Good Nodes in Binary Tree
GOBLIN (+20XP)
18.Binary Search Tree Iterator
GOBLIN (+20XP)
19.Delete Node in a BST
GOBLIN (+20XP)
20.Binary Tree Maximum Path Sum
BOSS FIGHT (+50XP)
21.Serialize and Deserialize Binary Tree
BOSS FIGHT (+50XP)