Question

calculate the maximum number of leaves in a 2-ary tree of height 10​

Answer 1

Answer:

1,255,00000 leaves un 2-aey tree

Answer 2

Answer:

Maximum number of leaves in a binary tree of height 10 is 1024

Step-by-step explanation:

Binary Tree - In a data structure when a data is recored from two successive data namely nodes, it form a tree like structure called Binary Tree.

Binary tree Leaves - It is a part of binary tree where nodes having no successive data or sub nodes.

Height of Binary tree - it is the maximum number of connection from one node to sub node in a binary tree from top to bottom.

Since for height one we would have maximum  2 number of leaves.

So, for height 10 we would have $2^{10}$ = 1024 number of leaves.