Question

A binary tree of height h has at least h node and atmost how many nodes

Answer 1

2h+1 -1..............✔✔✔✔

Answer 2

A binary tree of height h has at least h node and at most $2^{h} - 1$ number of nodes.

• Data structures are the different forms in which data can be visualized in programming. Arrays, linked lists, stacks, queues are the different types of data structures we can use to store and retrieve while programming.
• These data structures are linear, while Trees are hierarchical data structures that are used to perform various functions while programming. One such tree is the Binary Tree.
• Binary trees are the trees whose elements can have at most have 2 children only.
• Nodes are the number of elements of the tree, height is the maximum number of edges from the topmost node known as the root node to the leftmost child of the tree.
• Hence, For a binary tree of height h, the maximum number of nodes possible is given by the formula -    $2^{h}-1$.