Question

In a full binary tree number of nodes is 63
then the height of the tree is :​

Answer 1

Answer:

maximum height is: 62 (formula:n-1) n is number of nodes

minimum height is : 6 (formula log2(n+1)) n is number of nodes  

Answer 2

maximum height is: 62

The formula is  (formula:n-1) n is the number of nodes

Hence the minimum height is : 6

The formula is (formula log2(n+1))  n is the number of nodes  

Explanation:

A tree whose factors have a maximum of 2 kids is known as a binary tree.

Since every detail in a binary tree may have the most effective 2 kids, we usually call them the left and proper child. A Binary Tree node carries the following parts.

Data. Pointer to left child.

A binary tree is both empty or includes a node known as the basis collectively with binary timber known as the left subtree and the proper subtree.

The nodes of a binary tree may be numbered in a herbal way, degree through degree, left to proper.