CaffeCode
題庫
學習清單
登入
BST Patterns — CaffeCode
← 所有清單
BST Patterns
Binary search tree construction, traversal, and manipulation patterns.
13 道題目
#
題目
難度
Rating
1
99. Recover Binary Search Tree
Medium
—
2
109. Convert Sorted List to Binary Search Tree
Medium
—
3
449. Serialize and Deserialize BST
Medium
—
4
501. Find Mode in Binary Search Tree
Easy
—
5
654. Maximum Binary Tree
Medium
—
6
1008. Construct Binary Search Tree from Preorder Traversal
Medium
1563
7
1038. Binary Search Tree to Greater Sum Tree
Medium
1375
8
1305. All Elements in Two Binary Search Trees
Medium
1260
9
1361. Validate Binary Tree Nodes
Medium
1465
10
1382. Balance a Binary Search Tree
Medium
1541
11
1569. Number of Ways to Reorder Array to Get Same BST
Hard
2288
12
1609. Even Odd Tree
Medium
1749
13
2476. Closest Nodes Queries in a Binary Search Tree
Medium
1597