Structure
Operations
Ready...
Binary Search Tree (BST)
A hierarchical data structure where each node has at most two children. The left child is smaller, and the right child is larger than the parent. Efficient for searching and sorting.
AccessO(log n)
SearchO(log n)
InsertionO(log n)
account_tree
Empty Tree