Visualize hierarchical data structures.
Priority queue implementation using arrays (Min/Max Heap).
Ordered binary tree allowing fast search, insert, and delete operations.
Self-balancing BST that maintains O(log n) height.
Tree data structure for storing intervals or segments.
Data structure that can efficiently update elements and calculate prefix sums.