Data Structures provides theory notes and interactive models of four common data structures used in computing: the Stack, Circular Queue, Binary Search Tree and Linked List.
Each is designed to prevent the user from performing illegal operations such as adding data to an already full structure and explains why such actions are being taken.
The Binary Search Tree and Linked List models include a delay feature so that the Tree may be traversed, and the List read at a speed to suit the user, or, alternatively, instantaneously. In addition, the element of the Tree or List that is currently being accessed is highlighted, making it easier to see what is going on and to relate it to the algorithm being used.
There is an option to switch on a step-by-step explanation of how data is entered into a Binary Search Tree and how the three traversal methods operate, and how data is inserted into, read from and removed from a Linked List.
Alongside the four interactive models are a set of theory notes describing each of the data structures and designed to be read before interacting with the models and to reinforce learning as they are used.
The Stack Model:
The Queue Model:
The Binary Search Tree Model:
The Linked List Model:
The application is supported by a comprehensive help file.
Windows only.
For Site Licences, please contact us
