Subsections
Structures
Fundamental data types (FDT) include the basic structures like
binary trees, arrays, linked lists and graphs:
- Array
- Inserting keys in an array can be done by dropping them either on the
key (initially empty) or the index.
Default layout: array
Possible layouts: array
- Linked List
- Inserting keys in the list can be done by dropping them onto the
structure. This always inserts the keys as the first element of the
list. To insert a key in the middle of the list, drop the new key onto
the node after which you want the new key to be inserted.
Default layout: list
Possible layouts: list
- Dynamic Binary Tree
- A dynamic binary tree starts with a single node that is the root.
Dropping a key into a leaf, creates a node with two leaves,
enabling construction of arbitrary binary trees.
Default layout: layered tree
Possible layouts: array, layered tree, leaf tree, layered graph vertex
- Static Binary Tree (8)
- This is a binary tree with exactly eight nodes. This is an array representation of a tree.
Default layout: layered tree
Possible layouts: array, layered tree, leaf tree
- Common Tree
- This can be used to construct arbitrary trees.
A new node is inserted as a child of an existing node
by dropping a key onto the existing node.
Be sure to drop the key on the node (the background turns blue),
not onto the key (the key turns red).
Default layout: layered tree
Possible layouts: layered tree, leaf tree, layered graph vertex
- Directed Graph
- Nodes can be inserted by dropping them onto the graph.
Inserting edges can be done in three ways:
- Select Insert edge from the source node's popup menu
and then click on the target node.
- Select the source node, click Insert node on the toolbar
and then click on the target node.
- Select the source node with Shift key held down
and then click on the target node.
Default layout: layered graph
Possible layouts: layered graph, Kamada-Kawai graph,
Fruchterman-Reingold graph, dummy graph, array
- Undirected Graph
- Nodes and edges are inserted in the same way as for directed graphs.
Default layout: layered graph
Possible layouts: layered graph, Kamada-Kawai graph,
Fruchterman-Reingold graph, dummy graph, array
Conceptual data types (CDT) are more complex structures that
have a predefined set of operations whose implementation depends on
the CDT. Inserting keys should be always done by dropping the keys on
the title bar of the CDT. Keys can be deleted by selecting either
Delete from the popup menu of a key, or by selecting a key and
then deleting it using toolbar button, or by holding the Shift key while
dropping them outside the structure. For more information on deleting
parts of the structure see Section 4.3.
- Binary Search Tree
-
Default layout: layered tree
Possible layouts: array, layered tree, leaf tree, layered graph
vertex
- 2-3-4 Tree
-
Default layout: layered tree
Possible layouts: layered tree, leaf tree
- Red-Black Tree
-
Default layout: layered tree
Possible layouts: array, layered tree, leaf tree, layered graph
vertex
- Digital Search Tree
-
Default layout: layered tree
Possible layouts: layered tree, leaf tree
- Radix Search Tree
-
Default layout: layered tree
Possible layouts: array, layered tree, leaf tree, layered graph
vertex
- Binary Heap
-
Default layout: layered tree
Possible layouts: array, layered tree, leaf tree
- AVL Tree
-
Default layout: layered tree
Possible layouts: array, layered tree, leaf tree, layered graph
vertex
- Splay Tree
-
Default layout: layered tree
Possible layouts: array, layered tree, leaf tree, layered graph
vertex
- Stack(list)
-
Default layout: list
Possible layouts: list
- Stack(array)
-
Default layout: array
Possible layouts: array
- Queue
-
Default layout: list
Possible layouts: list
- Trash
- Visual objects that are dragged and dropped onto the Trash are deleted.
- Array of Keys
- An array of all the (capital) letters of the alphabet.
- Array of Random Keys
- An array of random keys of three alphanumeric characters.
- Array of Keys + ...
- A shortcut to create
both a Array of Keys and one of the CDTs.