1
Question
The maximum number of nodes in a binary tree of depth K is
The maximum number of nodes in a binary tree of depth K is
Open in App
Solution
The correct option is A 2K-1
The maximum number of nodes in a binary
tree of depth K is 2K-1, k >=1 . Here the depth of the tree is 1.
A binary tree is a tree data structure
in which each node has at most two children, which are referred to as the left
child and the right child.
The maximum number of nodes in a binary tree of depth K is 2K-1, k >=1 . Here the depth of the tree is 1.
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
Suggest Corrections
0
Similar questions