Unit 8 of 12 · Binary Search Tree (BST)

Insert

1 min Updated Jul 2026

Start with an empty tree. Insert five values one at a time: 50, 30, 70, 20, 40. Each new value walks down from the root, going left or right depending on the rule, until it finds an empty spot.