About Binary Search Trees

A Binary Search Tree (BST) is a node-based binary tree data structure with specific ordering properties.

• Left subtree contains nodes with keys lesser than parent

• Right subtree contains nodes with keys greater than parent

• Both subtrees must also be binary search trees

Time Complexity

Search: O(log n) average, O(n) worst case

Insert: O(log n) average, O(n) worst case

Delete: O(log n) average, O(n) worst case

How to Use

• Insert values using number field or comma-separated array

• Delete nodes by entering value in delete field

• Search for nodes using find field

• Use zoom controls for better tree viewing