Dsa
Binary Search Tree
Warm-up
Find Minimum Value
Given a binary search tree's inorder traversal as a space-separated list of integers, write a program to find the minimum value present in it. The minimum value in a BST is the leftmost node.
Input format:
- The first line contains space-separated integers representing the inorder traversal of the BST.
Output format:
- Print a single integer which is the minimum value in the BST.
Example:
Input:
15 20 30 5 10
Output:
5
Key concepts
binary_search_treefindingminimum
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now