Bissoy.com
Doctors Medicines MCQs Q&A

A treap is a cartesian tree with ___________

A treap is a cartesian tree with ___________ Correct Answer additional value, which is a priority value to the key generated randomly

A cartesian tree, if feeded with a sorted sequence will generate a straight path (or in tree terminology a skew tree). moreover a cartesian tree basing on same values from the search keys doesnot work well. so a cartesian tree with priority value in addition to search key is called treap.

Related Questions

Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode {              treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) {              int value=0;              if (tree != NULL) {              if (tree->leftMostChild == NULL)              value = 1;    else               value = DoSomething(tree->leftMostChild);               value = value + DoSomething(tree->rightSibling);     }               return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the 
Which of the below statements are true? i. Cartesian tree is not a height balanced tree ii. Cartesian tree of a sequence of unique numbers can be unique generated
What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue
Which of the following statements regarding tree are correct? (A) All the links of a tree together does not constitute the complement of the corresponding tree (B) A connected subgraph of a connected graph is a tree if there exist (n - 1) nodes of the group (C) A connected subgraph of a connected graph is a tree if there exist many paths between any pair of nodes in it (D) The number of terminal nodes of end vertices of every tree are atleast two (E) Every connected graph has atleast one tree Choose the correct answer from the options given below: (1) (A) and (B) only (2) (B) and (C) only (3) (B) and (D) only (4) (D) and (E) only
In the following question, there are six parts marked S1, S6, P, Q, R and S. The position of S1 and S6 are fixed. Some parts of the sentence have been jumbled up. Rearrange these parts and choose the proper sequence from the given options. (S1) Once upon a time, there lived a farmer in a village, beside a forest. (P) When the farmer was a little boy, he spent much of his time playing with the apple tree (Q) Those days, the apple tree had given the choicest of apples to him (R) However, as time passed, the apple tree became old and stopped bearing fruits (S) He had a big garden that had an old apple tree and other plants, trees and beautiful flowers (S6) Now that the farmer was not getting any apples from the tree, he decided that the tree was useless and cut it.
In the following question, there are six parts marked S1, S6, P, Q, R and S.The position of S1 and S6 are fixed. Some parts of the sentence have been jumbled up. Rearrange these parts and choose the proper sequence from the given options. (S1) Once upon a time, there lived a farmer in a village, beside a forest. (P) When the farmer was a little boy, he spent much of his time playing with the apple tree (Q)Those days, the apple tree had given the choicest of apples to him (R) However, as time passed, the apple tree became old and stopped bearing fruits (S)He had a big garden that had an old apple tree and other plants, trees and beautiful flowers (S6) Now that the farmer was not getting any apples from the tree, he decided that the tree was useless and cut it.
A straight tree breaks due to storm and the broken part bends so that the top of the tree touches the ground making an angle of 60° with the ground. The distance from the foot of the tree to the point, where the top point touches the ground is 15 m. Find the ratio between total height of the tree and the distance from foot of the tree to top point of the tree.
Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes
There is a statement followed by two conclusions. Decide which conclusion logically follows from the given statement (s). Statement: A garden has mango, teak, neem, orange, coconut and many trees. The mango tree is 7 meters tall, the orange tree is half of its height and the coconut tree is three times the height of the mango tree. Conclusion: I. The average height of the three trees is less than 10 meters. II. The tallest tree in the garden is the coconut tree. Choose the correct option from the following. A. Only (I) follows. B. Only (II) follows. C. (I) and (II) both follow. D. Neither (I) nor (II) follows.
Consider the following statements about the Khejadi' tree. A. This tree is mainly found in desert areas. B. This tree can grow without much water. C. This tree stores water in its trunk which can be used for drinking when needed. D. The bark of this tree is used for making medicine and its wood is not affected by insects. E. This tree has very few leaves. The correct statements are