12. Find Minimum & Maximum in BST
Traverses leftmost chain to find minimum value, and rightmost chain to find maximum value.
Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.
Asked in interviews at
Reference implementation (Python)
def find_min(root):
curr = root
while curr.left:
curr = curr.left
return curr.val
def find_max(root):
curr = root
while curr.right:
curr = curr.right
return curr.valEmbed this visualization
Drop a live, looping 12. Find Minimum & Maximum in BST canvas into a blog post or course page.
<iframe src="/embed/bst-min-max" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>Frequently asked
What is the time and space complexity of 12. Find Minimum & Maximum in BST?
12. Find Minimum & Maximum in BST runs in O(h) time and O(1) auxiliary space.
Is the 12. Find Minimum & Maximum in BST visualizer free?
The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.
Which companies ask 12. Find Minimum & Maximum in BST in interviews?
12. Find Minimum & Maximum in BST shows up in interviews at Goldman Sachs, Adobe, Salesforce.
How does the 3D visualization of 12. Find Minimum & Maximum in BST work?
Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.