Jump to Section
Table of Contents
🔗 Problem Statements
Problem Set Version 1
Problem Set Version 2
Problem Set Version 3
Unit 9 Session 1
Edit Page
Page History
Part of
TIP101 Unit 9
🔗 Problem Statements
Problem Set Version 1
Is Symmetric Tree
Root-to-Leaf Paths
Minimum Difference in BST
Increasing Order Search Tree
Equal Tree Split
Problem Set Version 2
Evaluate Boolean Full Binary Tree
Find Lonely Nodes
Kth Smallest Node in a BST
Second Minimum Node in a Special Binary Tree
Transformable Binary Trees by Swapping Subtrees
Problem Set Version 3
Evaluate Mathematical Expression Tree
Find Corresponding Node in Cloned Tree
Path Sum in Binary Tree
Check Balanced Binary Tree
Replace Node Value with Sum of Subtree