Question

The maximum possible height of a binary tree with 13 vertices is​

Answer 1

Answer:

Step-by-step explanation:

The maximum depth of a binary tree is the number of nodes from the root down to the furthest leaf node. In other words, it is the height of a binary tree. The maximum depth, or height, of this tree is 4; node 7 and node 8 are both four nodes away from the root.

Answer 2

The maximum height of a binary tree with $13$ vertices is $12$.

Explanation:

• A binary tree is a non-linear data structure consisting of nodes (vertices) and edges (paths connecting two nodes).
• The height of a binary tree is the length (number of edges) in the longest path from the root node to the deepest child node.
• In a binary tree a single node (parent node) can have at most two child nodes.
• Therefore in order to obtain the maximum height, all nodes will have only one child node.
• The maximum height in such a binary tree (having 'n' nodes) is equal to $n-1$.
• Here $n=13$, therefore the maximum height possible of the binary tree is $12$.