MCQOPTIONS
Bookmark
Saved Bookmarks
→
Ericsson
→
Aptitude & Logical - Ericsson
→
A full binary tree with n leaves contains
1.
A full binary tree with n leaves contains
A.
n nodes
B.
2n - 1 nodes
C.
log2 n nodes
D.
2n nodes
Answer» C. log2 n nodes
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which is the right way to declare constant in C?
In switch statement, each case instance value must be _______?
What is the work of break keyword?
What is function?
Which one of the following sentences is true ?
A binary tree with 27 nodes has _______ null branches.
Which one of the following is not a linear data structure?
Recursive functions are executed in a?
Queue is a _____________ list.
The statement print f ("%d", 10 ? 0 ? 5 : 1 : 12); will print?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply