CaffeCode
題庫
學習清單
登入
Tree Mastery — CaffeCode
← 所有清單
Tree Mastery
20 tree problems covering traversal, BST, and advanced tree algorithms.
20 道題目
#
題目
難度
Rating
1
104. Maximum Depth of Binary Tree
Easy
1116
2
226. Invert Binary Tree
Easy
1160
3
100. Same Tree
Easy
1176
4
572. Subtree of Another Tree
Easy
1377
5
543. Diameter of Binary Tree
Easy
1287
6
110. Balanced Binary Tree
Easy
1194
7
112. Path Sum
Easy
1181
8
108. Convert Sorted Array to Binary Search Tree
Easy
1281
9
102. Binary Tree Level Order Traversal
Medium
1308
10
199. Binary Tree Right Side View
Medium
1454
11
236. Lowest Common Ancestor of a Binary Tree
Medium
1660
12
105. Construct Binary Tree from Preorder and Inorder Traversal
Medium
1643
13
98. Validate Binary Search Tree
Medium
1490
14
230. Kth Smallest Element in a BST
Medium
1401
15
235. Lowest Common Ancestor of a Binary Search Tree
Medium
1333
16
450. Delete Node in a BST
Medium
1590
17
173. Binary Search Tree Iterator
Medium
1569
18
1448. Count Good Nodes in Binary Tree
Medium
1438
19
124. Binary Tree Maximum Path Sum
Hard
1807
20
297. Serialize and Deserialize Binary Tree
Hard
1884