Bissoy.com
Doctors Medicines MCQs Q&A

Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.

Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order. Correct Answer No

No, The inorder traversal will not give elements in sorted order. As heap is implemented as either min-heap or max-heap, the root will be have highest or lowest value than remaining values of the nodes. So this traversal will not give a sorted list.

Related Questions

Consider the following Inorder and Preorder traversal of a tree Inorder – D B E F A G H C Preorder - A B D E F C G H What is the Postorder Traversal of the same tree
Let M be a sequence of 9 distinct integers sorted in ascending order. How many distinct pairs of sequences, N and O are there such that i) each are sorted in ascending order, ii) N has 5 and O has 4 elements, and iii) the result of merging N and O gives that sequence?
Consider the following statements: I. The smallest element in a max-heap is always at a leaf node II. The second largest element in a max-heap is always a child of the root node III. A max-heap can be constructed from a binary search tree in Θ(n) time IV. A binary search tree can be constructed from a max-heap in Θ(n) time Which of the above statements are TRUE?
An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element? 
Abeer has 14 novels. Abeer’s friend Sanjay takes 3 of them and gives 2 novels to Abeer. Abeer donates 7 novels but buys 4. Joy takes 4 novels from Abeer and gives him 5. Abeer takes one novel from Sanjay and gives it to Joy in exchange for 3 more. Abeer gives those 3 novels to Sanjay and he gives Abeer a novel and a magazine. Rahul takes the magazine which Sanjay gave to Abeer and gives Abeer a textbook. Abeer gives the textbook to Joy in exchange for a novel. Rahul takes the novel from Sanjay, gives it to Joy for a magazine and gives Abeer the magazine for a novel. How many textbooks does Abeer have?
Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1:                 //initialize elements of y to 0                 //initialize elements X[i] [j] of X to i+j                       for (i = 0; i < n; i++)                                 Y[i] += X[0] [i]; Code Segment 2:                 //initialize elements of Y to 0                 //initialize elements X[i] [j] of X to i+j                        for (i = 0; i < n; i++)                                 Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory
Are the below statements true about skiplists? In a sorted set of elements skip lists can implement the below operations i.given a element find closest element to the given value in the sorted set in O(logn) ii.find the number of elements in the set whose values fall a given range in O(logn)
S1: The mail is first collected from different letter boxes.
P: From there it is sent to the head post office.
Q: It is then sorted out at the sorting office.
R: The mail is again sorted out at the head office by the concerned beat postman.
S: The sorted mail is sent to the zonal post office.
S6: Finally it is delivered to us.

The Proper sequence should be:
With eleven distinct consonants and five distinct vowels, how many distinct six letter words can be formed if middle two positions are occupied by vowels (may be repeated) and first two and last two positions are occupied by consonants (all distinct) ?
Justice is regarded as
1. Distinct from benevolence
2. Distinct from charity
3. Distinct from ethics
4. Distinct from awareness
Select the correct answer: