Binary Search Tree
An ordered binary tree where left children are smaller and right children are larger
Time Complexity
| Operation | Average | Worst Case |
|---|---|---|
| Insert | O(log n) | O(n) |
| Search | O(log n) | O(n) |
| Delete | O(log n) | O(n) |
| Build from n nodes | O(n log n) | O(n²) |
Controls
Nodes (0)
No nodes yet. Add some above!