⏟
Binary Search Tree
AP Computer Science A · Data Structures
⛶ Fullscreen
BST Properties
Left Child:
Value is strictly less than Parent.
Right Child:
Value is greater than or equal to Parent.
Search Time:
$O(\log n)$ average case, $O(n)$ worst case (unbalanced).
Traversals (Depth-First)
Pre-Order:
Root -> Left -> Right.
Used to copy trees.
In-Order:
Left -> Root -> Right.
Returns nodes in sorted order!
Post-Order:
Left -> Right -> Root.
Used to delete trees.
Tags
BST
java
recursion
tree
Traversal Output Sequence
Insert
Randomize 7 Nodes
Clear Tree
Recursive Traversals
In-Order (Sorted)
Pre-Order
Post-Order