| | A tree in which nodes are ordered so that all keys in a node's left subtree are less than the key of the object at the node, and all keys in a node's right subtree are greater than the key of the object at the node. (Also known as a search tree) |
| |
| | Traversal ordering where each node is processed after all nodes in its left subtree but before any nodes in its right subtree. |
| |
| | A tree with a maximum of two children, which are defined by their position, left or right. |
| |
| | Traversal ordering where each node is processed after all nodes in both its subtrees. |
| |
| | A subtree corresponding to any other node than the root is called a ______ subtree. |
| |
| | The length of the longest downward path to a leaf from a node is the node’s _____. |
| |
| | Traversal ordering where each node is processed before any nodes in its subtrees |
| |
| | A type of tree where the path taken is determined by a Boolean expression. |
| |
| | A tree can be thought of as either a data structure or as an : (3 words) |
| |
| | The length of the path from a node to the root is the node’s _____. |
| |
| | All of the nodes that have the same depth are on the same _____. |
| |
| | A tree type which includes arithmetic operands and operators. |
| |
| | The predecessor of a node or any of its predecessors |
| |
| | Any node of a tree that has child nodes. (2 words) |
| |
| | Another term for a leaf node is a ________ node. |
| |
| | The children of a node or any of their children |
| |
| | Any pair of nodes that have the same parent. |
| |
| | A node together with its descendants. |
| |
| | The unique node with no predecessor. |
| |
| | Trees have a ____________ structure. |
| |
| | A node with no successors. |
| |
| | The predecessor of a node. |
| |
| | Trees have ________ edges. |
| |
| |
| |
