BST Insert

← Back to Binary Search Trees

Search for the correct position (as in BST search), then insert as a leaf. Maintains the BST property. O(log n) average, O(n) worst case.

property bst