Minimum Difference in BST
Insert values → build BST → find min |a - b|
Number of nodes (N):
Values to insert (space separated):
10 5 20 3 7
🌲 Compute Min Diff
🔄 Reset
Minimum difference will appear here...
Best way:
Inorder traversal of BST gives sorted order
→ Just find minimum difference between consecutive elements
Time: O(n), Space: O(h) — using recursive inorder