Question
//e.g:-consider -complete binary tree:-height-3, [1,2,3,4,5,6,7]-answer must be 23
n=power(2,height)-1; //assume input is height and a[i] contains tree elements
for(i=1;i<=n;)
{
for(j=1;j<=pow(2,currentlevel-1);j++) //present level is initialized to 1 and sum is initialized to 0
{
sum=sum+a[i];
i=i+1;
}
//missing logic
}
a)
i=i+pow(2,currentlevel);
currentlevel=currentlevel+2;
j=1;
b)
i=i+pow(2,currentlevel);
currentlevel=currentlevel+2;
j=0;
c)
i=i-pow(2,currentlevel);
currentlevel=currentlevel+2;
j=1;
d)
i=i+pow(2,currentlevel);
currentlevel=currentlevel+1;
j=1;a.
a
b.
b
c.
c
d.
d
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. What must be the missing logic in place of missing lines for finding sum of nodes of binary tree in alternate levels?
Similar Questions
Discover Related MCQs
Q. Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?
View solution
Q. Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?
for binary heap
-insert: O(log n)
-delete min: O(log n)
for a tree
-insert: O(log n)
-delete: O(log n)
Then why go with array representation when both are having same values ?
View solution
Q. Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
View solution
Q. Advantages of linked list representation of binary trees over arrays?
View solution
Q. Disadvantages of linked list representation of binary trees over arrays?
View solution
Q. How to travel a tree in linkedlist representation?
View solution
Q. Level order traversal of a tree is formed with the help of
View solution
Q. Why we prefer threaded binary trees?
View solution
Q. The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
i) from root search for the node to be deleted
ii)
iii) delete the node at
what must be statement ii) and fill up statement iii)
View solution
Q. What may be the psuedo code for finding the size of a tree?
View solution
Q. What is the time complexity of pre-order traversal in the iterative fashion?
View solution
Q. What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
View solution
Q. To obtain a prefix expression, which of the tree traversals is used?
View solution
Q. What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
View solution
Q. What is the time complexity of level order traversal?
View solution
Q. Which of the following graph traversals closely imitates level order traversal of a binary tree?
View solution
Q. In a binary search tree, which of the following traversals would print the numbers in the ascending order?
View solution
Q. The number of edges from the root to the node is called __________ of the tree.
View solution
Q. The number of edges from the node to the deepest leaf is called _________ of the tree.
View solution
Q. What is a full binary tree?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
