Question

In a full binary tree if number of internal nodes is i, then number of leaves l are?

Answer 1

Explanation:

✍✍✍Fact: The minimum number of nodes in a binary tree of height h = h + 1. Proof: The binary tree of height h with the minimum number of nodes is a tree where each node has one child:

✍✍✍Fact: The maximum number of nodes in a binary tree of height h = 2h+1 − 1. Proof: The perfect binary tree has the maximum number of nodes.

Answer 2

hello!

_____

we can say that a full binary tree with N leaves contains 2N - 1 nodes.

how to calculate:-.

Total number of nodes in a full binary tree = Number of non-leaf nodes + Number of leaf nodes