Full Binary Tree (original) (raw)

Last Updated : 07 May, 2025

Try it on GfG Practice redirect icon

What is a Binary Tree?

A binary tree is a tree data structure with a maximum of 2 children per node. We commonly refer to them as the left and right child as each element in a binary tree may only have two children.

What is a Full Binary Tree?

A full binary tree is a binary tree with either zero or two child nodes for each node.

A full binary tree, on the other hand, does not have any nodes that have only one child node.

Full Binary Tree

Full Binary Tree Theorem:

Let T be a nonempty, full binary tree Then:

This is known as the full binary tree theorem.

**Facts derived from the theorem:

Some other properties:

**Related Articles: