Binary Search Tree¶
Table of Contents¶
- 270. Closest Binary Search Tree Value (Easy) 👑
- 272. Closest Binary Search Tree Value II (Hard) 👑
- 255. Verify Preorder Sequence in Binary Search Tree (Medium) 👑
- 1214. Two Sum BSTs (Medium) 👑
- 333. Largest BST Subtree (Medium) 👑
270. Closest Binary Search Tree Value¶
-
LeetCode | LeetCode CH (Easy)
-
Tags: binary search, tree, depth first search, binary search tree, binary tree
272. Closest Binary Search Tree Value II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: two pointers, stack, tree, depth first search, binary search tree, heap priority queue, binary tree
255. Verify Preorder Sequence in Binary Search Tree¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, stack, tree, binary search tree, recursion, monotonic stack, binary tree
1214. Two Sum BSTs¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: two pointers, binary search, stack, tree, depth first search, binary search tree, binary tree
333. Largest BST Subtree¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming, tree, depth first search, binary search tree, binary tree