AP CS - Trees Vocab

Stores one item, a link (pointer) to the left, and a link to the right. Links can be null.

The topmost node. Does not have parents.

The predecessor of a node. Nodes only have one parent.

In a binary tree, the node found on the left of a parent

In a binary tree, the node found on the right of a parent

In a binary tree, two children who have the same parent

In a binary tree, nodes that do not have siblings

A node that has no children

The pointer / link connecting two nodes

The sequence of edges connecting nodes

# edges in a path

Levels of the rows of generations in a tree; starts at 0 (the root is at level 0)

Longest path down / depth

Maximum height from left + Maximum height from right

The root changes to a different nod within the original

A tree where every node as 0, 1, or 2 children

The height of the left subtree and the right subtree differ at most by one

Each leaf is on the same level and everyone else has two children (perfect triangle)

Every level has as many nodes as possible, but the last one just has all the nodes to the left

Leaves are numbers and other are operators

Left < Node < Right for all nodes

All parents are less than their children + complete (PriorityQueue)

All parents are greater than their children + complete