Q221
Open questionThe post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be . . . . . . . .
Select an option to see the answer and solution.
Data Structure · all questionsBinary Search Trees(B Tree)
Binary Search Trees(B Tree)
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
275
Questions
12/14
Page
Pick an option on a question to see the right answer and solution.
Q222
Open questionHow many top trees are there in a tree with single vertex?
Select an option to see the answer and solution.
Q223
Open questionWhat is the speciality of cartesian sorting?
Select an option to see the answer and solution.
Q224
Open questionConsider the below left-left rotation pseudo code where the node contains value pointers to left, right child nodes and a height value and Height() function returns height value stored at a particular node.
avltree leftrotation(avltreenode z):
avltreenode w =x-left
x-left=w-right
w-right=x
x-height=max(Height(x-left),Height(x-right))+1
w-height=max(missing)+1
return wSelect an option to see the answer and solution.
Q225
Open questionIn which of the following self - balancing binary search tree the recently accessed element can be accessed quickly?
Select an option to see the answer and solution.
Q226
Open questionWhich operation is used to break a preferred path into two sets of parts at a particular node?
Select an option to see the answer and solution.
Q227
Open questionWhat does the below definations convey?
i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.
ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.
i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.
ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.
Select an option to see the answer and solution.
Q228
Open questionWhich of the following is not an advantage of trees?
Select an option to see the answer and solution.
Q229
Open questionWhat is a full binary tree?
Select an option to see the answer and solution.
Q230
Open questionWhich of the following graph traversals closely imitates level order traversal of a binary tree?
Select an option to see the answer and solution.
Q231
Open questionWhich special balanced binary search tree is used to store the nodes of auxiliary tree?
Select an option to see the answer and solution.
Q232
Open questionGeneral ordered tree can be encoded into binary trees.
Select an option to see the answer and solution.
Q233
Open questionWhat is the time complexity of for achieving competitive ratio by tango tree?
Select an option to see the answer and solution.
Q234
Open questionWhat is/are the disadvantages of implementing tree using normal arrays?
Select an option to see the answer and solution.
Q235
Open questionWhat is the speciality about the inorder traversal of a binary search tree?
Select an option to see the answer and solution.
Q236
Open questionThe number of edges from the root to the node is called . . . . . . . . of the tree.
Select an option to see the answer and solution.
Q237
Open questionA binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
Select an option to see the answer and solution.
Q238
Open questionIn a binary search tree, which of the following traversals would print the numbers in the ascending order?
Select an option to see the answer and solution.
Q239
Open questionWhat must be the ideal size of array if the height of tree is 'l'?
Select an option to see the answer and solution.
Q240
Open questionFor the tree below, write the post-order traversal.
Select an option to see the answer and solution.