Binary Search Tree
DESCRIPTION
Interactive BST visualization with insert, search, and delete operations. Animated traversal modes (in-order, pre-order, post-order) highlight nodes step by step. Quick-build presets for balanced and skewed trees. Shows height, min/max, and balance status. Demonstrates O(log n) average vs O(n) worst-case search.
- BST
- binary search tree
- recursion
- tree
- O(log n)
- data structure
- AP CSA
RELATED VISUALIZATIONS
Recursion Visualizer
Step-through visualization of recursive call trees and call stacks. Four algorithms: factorial, Fibonacci, power, and sum(1..n). Play/step controls animate call expansion and return-value propagation. Shows total calls, max depth, base case count, and final result. Side panel displays live call stack frames.
Array & ArrayList Operations
Interactive array visualization showing access, insert, delete, and search operations with animated element shifting. Compare fixed-size int[] arrays vs dynamic ArrayList. Linear search and binary search with step-by-step comparison counting. Shuffle, sort, and reverse utilities. Displays operation complexity (O(1) access, O(n) insert/delete, O(log n) binary search).
Inheritance & Polymorphism
Visual class hierarchy explorer with three example hierarchies: Animal, Shape, and Vehicle. Select reference type and actual object type to demonstrate polymorphic method dispatch. Shows overridden methods highlighted in green, dynamic vs static dispatch, and console output. Polymorphic array demo iterates through superclass references calling overridden methods.
Big-O Complexity
Interactive growth-rate comparison chart for O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ). Adjustable input size n with live curve updates. Toggle individual complexity classes on/off. Algorithm examples (array access, binary search, linear search, merge sort, bubble sort, selection sort) with code snippets. Linear and log scale views.