Section 31.13 Vocabulary
- binary search tree
-
A binary tree where values in the left subtree are less than the node and values in the right subtree are greater than the node.
- binary tree
-
A tree in which each node has at most two children.
- children
-
The nodes directly below a given node in a tree.
- depth
-
The number of edges from the root to a given node.
- height
-
The number of edges on the longest path from a node to a leaf.
- in-order traversal
-
A traversal that visits the left subtree, then the node, then the right subtree.
- internal nodes
-
Nodes that have at least one child.
- leaves
-
Nodes with no children.
- Node (Tree)
-
A tree element that stores a value and references to child nodes.
- parent node
-
The node directly above a given node in a tree.
- post-order traversal
-
A traversal that visits the left subtree, then the right subtree, then the node.
- pre-order traversal
-
A traversal that visits the node, then the left subtree, then the right subtree.
- root
-
The top node of a tree, which has no parent.
- search tree
-
A tree organized so that comparisons can efficiently guide search.
- siblings
-
Nodes that share the same parent.
- size
-
The number of nodes in a tree or subtree.
- tree
-
A data structure made of nodes connected by parent-child relationships. Every node in a tree has exactly one parent, except for the root node, which has no parent.
You have attempted of activities on this page.
