Binary tree

Binary Tree

A tree data structure in which each node has at most two children.

Root

The top node of a tree from which all nodes descend.

Complete Binary Tree

A binary tree where every level, except possibly the last, is completely filled and all nodes are as far left as possible.

Perfect Binary Tree

A binary tree where all internal nodes have two children and all leaves are at the same depth.

Height of a tree

The longest path from the root to a leaf, counted by the number of edges.

Min number of leaves

Occurs in a degenerate tree where each node has only one child.

In-order Traversal

A tree traversal method where the left subtree is visited first, followed by the root node, then the right subtree.

Pre-order Traversal

A tree traversal method where the root node is visited first, followed by the left subtree and then the right subtree.

Post-order Traversal

A tree traversal method where the left and right subtrees are visited first, followed by the root node.

Binary Search Tree (BST)

A type of binary tree where the left sub-tree has nodes with values less than the root, and the right sub-tree has nodes with values greater than or equal to the root.

Finding Minimum in BST

The process of locating the node with the smallest value in a binary search tree.

Finding Maximum in BST

The process of locating the node with the largest value in a binary search tree.

Delete Node with One Child

The action of removing a node which is replaced by its only child.

Delete Node with Two Children

The action of removing a node which requires replacing it with either its inorder predecessor or successor.

Adjacency List

A way of representing a graph where each node has a list of its adjacent nodes.

Traversal Order

The sequence in which the nodes of a tree are visited during traversal.