Checkpoint 8.23.1.
- tree
- Hierarchal data structure with a root, branches, and leaves.
- rotation
- Pivoting the parent and children nodes in a subtree to reorganize their hierarchy
- preorder
- Recursive tree traversal in which the root node is visited, then the left, followed by the right subtree
- postorder
- Recursive tree traversal in which the left subtree is visited, then the right, followed by the root node
- inorder
- Recursive tree traversal in which the left subtree is visited, then the root node, followed by the right subtree
- successor
- Replaces another node while preserving the binary search tree relationships; the next-largest key in the tree
- subtree
- Section of a tree
- complete binary tree
- Tree in which each level has all of its nodes, with the exception of the bottom level
- level
- Number of edges on the path from the root to the current node
- height
- Maximum level of any node in the tree
- AVL tree
- Binary search tree that automatically makes sure the tree remains balanced at all times
- binary search tree
- Binary tree in which each node has no more than 2 children.
- bst propery
- Node values in the left sub-tree are less than the parent while node values in the right sub-tree are are greater than the parent
- Leaf node
- Node that has no children
- root
- Starting point of the tree
- path
- Ordered list of nodes connected by edges
- parent
- Node that leads to other nodes
- max heap
- Largest key is always at the front
Drag the word on the left to its corresponding definition (Note not all words in the glossary are here)
Look at your glossary
