Build Binary Search Tree
Insert elements one by one → see BST + Inorder traversal
Number of nodes (N):
Values to insert (space separated):
10 5 20 3 7
🌲 Build BST
🔄 Reset
Inorder traversal will appear here...
BST Insertion Rule:
left < node < right
Inorder traversal:
Left → Root → Right (gives sorted order)
Values are inserted one by one in the order given.