A binary tree is a tree whose element or node can have a maximum of two children. Let’s look at this special case of trees and learn about their properties.
The following are the properties of the binary trees:
In any binary tree, the minimum number of nodes will be one more than the value of
height. This is the number of nodes required to construct a tree.
h=3, then nodes will be
The maximum number of nodes that can be inserted in any binary tree of height
h will be equal to 2h- 1.
h= 3, then 23- 1.
8 -1= 7.
Therefore, the maximum number of nodes to be inserted for the height of
h=3 will be
The number of leaf nodes in a binary tree is equal to the nodes with degree two, plus one. Say a binary tree has two children. Then the total number of leaf nodes of that binary tree will be one greater than the nodes having two children.
Total number of leaf nodes = Nodes with 2 children + 1
Here, the total number of leaf nodes (no child or a successor) is 3, and the leaf nodes are E, F, and G.
Whereas the nodes with two children are 2. Node A and B have 2 children. Hence, this proves the property.
In a binary tree, the maximum number of nodes gained by any level is equal to the power of 2 for that level.
In a simpler words, the level is donated by n. Then, maximum nodes of that binary tree will be 2n.
n = 2 then 22= 4.
Level 2 coverts the nodes (D, E, F, and G).
This property says that the minimum number of levels or a height of a binary tree is the Log2 of (N+1). Here N represents the maximum number of nodes possessed by a binary tree at the height
We have already discussed property 2 along with the example. Let's use that answer to calculate the height
It is equal to the height chosen in the example of property 2.
View all Courses