Find Minimum in BST

Easy Acceptance 85.18% Points 20

You are given the root of a Binary Search Tree (BST). Your task is to find and return the minimum value stored in the tree.

Return the smallest value present in the BST.

Examples

Example 1

Input: root = [5,3,8,1,4,null,9]
Output: 1
Explanation: The leftmost node holds the smallest value, which is 1.

Example 2

Input: root = [10,null,20]
Output: 10
Explanation: The root has no left subtree, so the root itself is the minimum.

Example 3

Input: root = [42]
Output: 42
Explanation: A single-node BST has its minimum equal to the root value.

Constraints

Hints

In a BST:
- Every node in the left subtree has a smaller value than the current node.
- Therefore, the leftmost node always contains the minimum value in the tree.

Topics

Tree Traversal Binary Tree

Companies

PhonePe Paytm

Added 08 Aug 2026 85.18% acceptance

Ln 1, Col 1Sign in to save your code

Sample inputs for this problem are shown in the examples.