Skip to content

Week 12

Patterns: Binary Search Trees, Binary Trees - Properties
Total Problems: 13
Completed: 13 (100%)

Progress by Difficulty

Difficulty Total Completed Remaining Percentage
🟢 Easy 1 1 0 100%
🟡 Medium 10 10 0 100%
🔴 Hard 2 2 0 100%

Problems

# Problem Pattern D Status Conf
148 Balanced Binary Tree Binary Trees - Properties E ✅ HGH
149 Construct Binary Tree from Preorder and Inorder Traversal Binary Trees - Properties M ✅ HGH
150 Construct Binary Tree from Inorder and Postorder Traversal Binary Trees - Properties M ✅ HGH
151 Path Sum II Binary Trees - Properties M ✅ HGH
152 Sum Root to Leaf Numbers Binary Trees - Properties M ✅ MED
153 Lowest Common Ancestor of a Binary Tree Binary Trees - Properties M ✅ HGH
154 Diameter of Binary Tree Binary Trees - Properties M ✅ HGH
155 Serialize and Deserialize Binary Tree Binary Trees - Properties H ✅ MED
156 Validate Binary Search Tree Binary Search Trees M ✅ MED
157 Kth Smallest Element in a BST Binary Search Trees M ✅ HGH
158 Lowest Common Ancestor of a Binary Search Tree Binary Search Trees M ✅ HGH
159 Delete Node in a BST Binary Search Trees M ✅ MED
160 Recover Binary Search Tree Binary Search Trees H ✅ MED

Last Updated: 2026-02-13 19:40:00
Auto-generated from CSV by update_progress.py