Graph structure, including the adjacency list storage representation of the graph structure, depth-first search and breadth-first search, finding the Euler path in the graph, topological sorting, maximum connected components, minimum spanning tree problem, and shortest single source Path problem.
In this app, you can dynamically debug three traversals of the binary tree (including non-recursive traversal implementations), searching in the tree, balance adjustments in the AVL tree and red-black tree, and heap sorting.
Tree structures, including binary tree, binary search tree, AVL tree, red-black tree, and heap.
A novel data structure learning app, the most significant feature is that you can dynamically debug the data structure in this app, and visually observe the changes in the data structure during the operation.
Linear structures are the basis for other advanced data structures, as fine as advanced algorithms.