TIP101 Unit 9 Session 1

Part of TIP101 Unit 9

🔗 Problem Statements

Problem Set Version 1

1. Is Symmetric Tree
2. Root-to-Leaf Paths
3. Minimum Difference in BST
4. Increasing Order Search Tree
5. Equal Tree Split

Problem Set Version 2

1. Evaluate Boolean Full Binary Tree
2. Find Lonely Nodes
3. Kth Smallest Node in a BST
4. Second Minimum Value in a Special Binary Tree
5. Transformable Binary Trees by Swapping Subtrees

Problem Set Version 3

1. Evaluate Mathematical Expression Tree
2. Find Corresponding Node in Cloned Tree
3. Path Sum in Binary Tree
4. Check Balanced Binary Tree
5. Replace Node Value with Sum of Subtree