Question

Consider the tree T in which left subtree contains half of the maximum number of nodes possible in the avl tree of height 6 and right subtree contains one 3rd of the minimum number of nodes possible in Avl tree of height 6.What will be total number of nodes in T?

Answer 1

Binary tree is a tree data structure in which each node has at most two child nodes. The number of subtrees of a node is called the degree of the node. In a binary tree, all nodes have degree 0, 1, or 2. The degree of a tree is the maximum degree of a node in the tree. A binary tree is of degree 2.

Answer 2

Answer: 75

Explanation: for left maximum will be 63

for right 11

1 for root