Final Flashcards
A list in which every node has a successor; the “last” element is succeeded by the “first” element
Circular linked list
A linked list in which each node is linked to both its successor and its predessor
Doubly linked list
A systematic way of visiting all the nodes in a binary tree by visiting the nodes in the left subtree of a node, then visiting the nodes in the right subtree of the node, and then visiting the node
Postorder traversal
A placeholder node at the end of a list; used to simplify list processing
Trailer node
A list in which elements are placed in no particular order; the only relationship between data elements is the predecessor and successor relationships
Unsorted list
A binary tree in which the value in any node is greater than or equal to the value in its left child and any of its descendants (the nodes in the left subtree) and less than the value in its right child and any of its descendants (the nodes in the right subtree)
Binary search tree
A binary tree that is either full or full through the next-to-last level, with the leaves on the last level as far to the left as possible
Complete binary tree
A tree in which each node is capable of having two child nodes: a left child node and a right child node
Binary tree
Perform more than one task at a time
Multitask
A tree node that has no children
Leaf
Several interacting code sequences are executing simultaneously, possilby through an interleaving of the statements by a single processor, possibly through execution on distinct processors
Concurrency
Each element except the first has a unique predecessor, and each element except the last has a unique successor
Linear relationship
A placeholder node at the beginning of a list; used to simplify list processing
Header node
A child of a node, or a child of a parent
Descendant
A collection that exhibits a linear relationship among its elements
List
The top node of a tree structure; a node with no parent
Root
A method that return an element of a data structure and advances the current position to the next element
Iterator method
A systematic way of visiting all the nodes in a binary tree by visiting the nodes in the left subtree of a node, then visiting the node, and then visiting the nodes in the right subtree of the node
Inorder traversal
A structure in which elements are added to the rear and removed from the front; a “first in, first out” (FIFO) structure
Queue
A systematic way of visiting all the nodes in a binary tree by visiting a node, then visiting the nodes in the left subtree of the node, and then visiting the nodes in the right subtree of the node
Preorder traversal
A parent of a node, or a parent of an ancestor
Ancestor
A binary tree in which all of the leaves are on the same level and every nonleaf node has two children
Full binary tree
A list in which each element has an index value associated with it
Indexed list
A structure with a unique starting node (the root), in which each node is capable of having multiple child nodes, and in which a unique path exists from the root to every other node
Tree
