Binary search tree keys within a rangeCodingGiven a binary search tree (as a level-order list with nulls for missing children) and an inclusive range low, high, return every key in the range in ascending order. Skip the…
Last asked Sep 2026
#binary search tree
Lowest common ancestor in a binary search treeCodingGiven a binary search tree and two distinct keys that are both in it, return their lowest common ancestor: the deepest node whose subtree contains both. A node's subtree includes…Last asked Sep 2026- Kth smallest value in a binary search treeCodingReturn the kth smallest value in a binary search tree.Last asked Aug 2026
- Validate a binary search treeCodingDecide whether a binary tree is a valid binary search tree.Last asked Apr 2026
Kth smallest element in a BSTCodingGiven the root of a binary search tree and an integer k, return the k-th smallest value in it, ideally stopping the in-order walk as soon as you reach it.Last asked Feb 2026
Range sum of a BSTCodingGiven the root of a binary search tree and a range low, high, return the sum of the values inside the range, skipping subtrees that cannot contain any. Variants reported: return…Last asked Oct 2025- Closest binary search tree valueCodingGiven a binary search tree and a target number (possibly fractional), return the value in the tree closest to it, walking down one path from the root.Last asked Jul 2025
- Delete a node from a binary search treeCodingGiven the root of a binary search tree and a key, delete the node with that key and return the root, keeping it a valid BST. Handle the cases of a leaf, a node with one child, and…Last asked Apr 2025
- +2Largest value shared by two BSTsCodingYou are given the roots of two binary search trees, a and b, holding integer values. Return the largest integer that appears in both trees. If the trees share no value, return -1…