full-binary-tree

Full Binary Tree vs Complete Binary Tree

A full binary tree is a binary tree in which all of the nodes have either 0 or 2 offspring. In other terms, a full binary tree is a binary tree in which all nodes, except the leaf nodes, have two offspring. When all of the levels of a binary tree are entirely filled, except for the last level, which can contain 1 or 2 children nodes and is filled from the left, it is said to be a complete binary tree.

Posted September 12, 2022 by Rohith and Anusha ‐ 1 min read

⌖ quick-references blog full-binary-tree complete-binary-tree