| 1. | | Traversal ordering where each node is processed after all nodes in its left subtree but before any nodes in its right subtree. |
| |
| 2. | | A node together with its descendants. |
| |
| 3. | | Traversal ordering where each node is processed before any nodes in its subtrees. |
| |
| 4. | | 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) |
| |
| 5. | | The length of the path from a node to the root is the node’s _____. |
| |
| 6. | | Another term for a leaf node is a ________ node. |
| |
| 7. | | All of the nodes that have the same depth are on the same _____. |
| |
| 8. | | Trees have ________ edges. |
| |
| 9. | | The predecessor of a node or any of its predecessors. |
| |
| 10. | | A set or list of trees. |
| |
| 11. | | Any successor of a node. |
| |
| 12. | | A tree with a maximum of two children, which are defined by their position, left or right. |
| |
| 13. | | The unique node with no predecessor. |
| |
| 14. | | A tree can be thought of as either a data structure or as an ________ ____ ____. (3 words) |
| |
| 15. | | The length of the longest downward path to a leaf from a node is the node’s _____. |
| |
| 16. | | Trees have a ____________ structure. |
| |
| 17. | | Traversal ordering where each node is processed after all nodes in both its subtrees. |
| |
| 18. | | A binary tree in which internal nodes completely fill every level. |
| |
| 19. | | Any node of a tree that has child nodes. (2 words) |
| |
| 20. | | The children of a node or any of their children. |
| |
| 21. | | A type of tree where the path taken is determined by a Boolean expression. |
| |
| 22. | | Any pair of nodes that have the same parent. |
| |
| 23. | | To systematically visit every node in a tree. |
| |
| 24. | | A subtree corresponding to any other node than the root is called a ______ subtree. |
| |
| 25. | | A node with no successors. |
| |
| 26. | | The predecessor of a node. |
| |
| 27. | | A tree type which includes arithmetic operands and operators. |
| |
