Unit 8 Session 2

Part of TIP101 Unit 8

🔗 Problem Statements

Problem Set Version 1

1. Is Uni-valued
2. Binary Tree Height
3. BST Insert I
4. BST Remove I
5. BST In-order Successor
6. Merge Binary Trees

Problem Set Version 2

1. Is Even-valued
2. Binary Tree Max
3. BST Insert II
4. BST Remove II
5. BST In-order Predecessor
6. Identical Binary Trees

Problem Set Version 3

1. Is Odd-valued
2. Binary Tree Min
3. BST Insert III
4. BST Remove III
5. BST Find Floor
6. Nested Binary Trees