MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized
→
In a full binary tree if there are L leaves, then...
1.
In a full binary tree if there are L leaves, then total number of nodes N are?
A.
N = 2*L
B.
N = L + 1
C.
N = L – 1
D.
N = 2*L – 1
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following is incorrect with respect to binary trees?
In a full binary tree if there are L leaves, then total number of nodes N are?
In a full binary tree if number of internal nodes is I, then number of nodes N are?
What is the average case time complexity for finding the height of the binary tree?
IN_A_FULL_BINARY_TREE_IF_THERE_ARE_L_LEAVES,_THEN_TOTAL_NUMBER_OF_NODES_N_ARE??$
Which_of_the_following_is_correct_with_respect_to_binary_trees?$
In a full binary tree if number of internal nodes is I, then number of leaves L are?
Which of the following is not an advantage of trees?
What is the time complexity for finding the height of the binary tree?
What is a complete binary tree?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies