ToolSphere
All tools

Data Structures Lab

Build intuition for a CS 61B-style data structures course. Compare ordered search trees, priority queues and hash tables by tracing their operations. This independent lab is not affiliated with a university.

1. Trace trees and priority queues

Insert, delete and search integer keys. Compare an ordinary BST with AVL rotations, then inspect min and max heap sifts and traversal orders.

2. Compare hashing

Explore hash buckets and collision handling. Compare the lookup strategy with the ordered comparisons used in a search tree.

Other labs

Frequently asked questions

Is this tied to one course?

No. It covers common data structures topics found in US courses such as CS 61B. Follow your instructor’s conventions for height, duplicates and deletion.

Which tree conventions are used?

The visualizer counts height in edges, ignores duplicate search-tree keys and deletes a two-child node using its in-order successor. Heaps retain duplicate values.

Can I see each operation?

The tree visualizer lists key comparisons, rotations and sifts. The hash table simulator shows its own collision-handling steps.