Tree Data Structures

Flashcards on the vocabulary and concepts related to tree data structures.

Tree

A non-linear/hierarchical data structure with a root, branches, and leaves.

Root

The topmost node of a tree.

Branch

A subtree that extends from a parent node.

Leaf

An element with no children in a tree.

Binary Tree

A type of tree where each node has at most two children.

Full Binary Tree

A binary tree in which every node has 0 or 2 children.

Complete Binary Tree

A binary tree where every level is completely filled, except possibly for the last level.

Balanced Binary Tree

A binary tree where the height of the left and right subtrees of any node differ by no more than 1.

Parent

An element directly above a node in the tree.

Child

An element directly under a node in the tree.

Height of a Tree

The number of edges on the longest path from the root to a leaf.

Node

An individual element of a tree data structure.

Edge

A connection between two nodes.