An ordered tree where every left child is smaller and every right child larger. Insert, search, and delete in O(log n) on average, and traverse it breadth-first (level-order) or depth-first (pre-, in-, and post-order).
An ordered tree where every left child is smaller and every right child larger. Insert, search, and delete in O(log n) on average, and traverse it breadth-first (level-order) or depth-first (pre-, in-, and post-order).
Time complexity: O(log n). Space complexity: O(n).
Use the interactive visualizer above to run Binary Search Tree on your own input and watch every comparison, swap, and operation animate step by step — pause, scrub, or replay at any speed.