Binary Search Tree Explorer

Binary Search Tree

A binary search tree (BST) is a hierarchical data structure where each node has at most two children, with all nodes in the left subtree having values less than the node's value and all nodes in the right subtree having values greater than the node's value.

Time Complexity:

• Search: O(log n) average, O(n) worst
• Insert: O(log n) average, O(n) worst
• Delete: O(log n) average, O(n) worst

Use the controls above to perform operations on the BST.