What is Full Binary Tree?

A full binary tree is a type of binary tree in which every node has either zero or two children.

Full Binary Tree example

Properties of Full Binary Tree:

Let i be the number of internal nodes, n be the total number of nodes, l be the number of leaf nodes and h be the total number of levels

The number of leaves is (i + 1).
The total number of nodes is (2*i + 1).
The number of internal nodes is (n – 1) / 2.
The number of leaves is (n + 1) / 2.
The total number of nodes is (2*l – 1).
The number of internal nodes is (l – 1).
The number of leaves is at most (2^h – 1).

How to identify a Full Binary Tree:

To determine if a given binary tree is a full binary tree, we can use the following steps:

Traverse the tree using any traversal algorithm (in order, preorder, postured, level order).
For each internal node (non-leaf node), check if it has exactly two children.
- If it does not have exactly two children, then the tree is not a full binary tree.
- If all internal nodes have exactly two children, then the tree is a full binary tree.

To see the implementation and details of how to identify, refer to this article.

What else can you read?

Article Tags :

DSA

Tree

Definitions and Meanings

Recommended Articles

1. Check whether a binary tree is a full binary tree or not | Iterative Approach

2. Check whether a binary tree is a full binary tree or not

3. Complexity of different operations in Binary tree, Binary Search Tree and AVL tree

4. Convert a Binary Tree into its Mirror Tree (Invert Binary Tree)

5. Construct Full Binary Tree using its Preorder traversal and Preorder traversal of its mirror tree

6. Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST

7. Convert a Generic Tree(N-array Tree) to Binary Tree

8. Convert a Binary Tree to Threaded binary tree | Set 1 (Using Queue)

9. Binary Tree to Binary Search Tree Conversion using STL set

10. Check whether a given binary tree is skewed binary tree or not?

11. Check if a binary tree is subtree of another binary tree using preorder traversal : Iterative

12. Check if a Binary tree is Subtree of another Binary tree | Set 3

13. Binary Tree to Binary Search Tree Conversion

14. Check if a Binary Tree is subtree of another binary tree | Set 1

15. Check if a binary tree is subtree of another binary tree | Set 2

16. Minimum swap required to convert binary tree to binary search tree

17. Convert a Binary Tree to Threaded binary tree | Set 2 (Efficient)

18. Difference between Binary Tree and Binary Search Tree

19. Construct Full Binary Tree from given preorder and postorder traversals

20. Full Binary Tree

21. Difference between Full and Complete Binary Tree

22. Find the number of colored nodes according to given queries in a full Binary Tree

23. Calculate depth of a full Binary tree from Preorder

24. Print all full nodes in a Binary Tree

25. Count full nodes in a Binary tree (Iterative and Recursive)