Q241
Open questionHow many orders of traversal are applicable to a binary tree (In General)?
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
13/14
Page
Pick an option on a question to see the right answer and solution.
Q242
Open questionWhich of the following properties are obeyed by all three tree - traversals?
Select an option to see the answer and solution.
Q243
Open questionLevel order traversal of a tree is formed with the help of
Select an option to see the answer and solution.
Q244
Open questionWhich type of data structure does rope represent?
Select an option to see the answer and solution.
Q245
Open questionWhat is inefficient with the below threaded binary tree picture?
Select an option to see the answer and solution.
Q246
Open questionTwo balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in . . . . . . . . time.
Select an option to see the answer and solution.
Q247
Open questionWhat is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?
checkSum(struct bin-treenode *root , int sum) :
if(root==null)
return sum as 0
else :
leftover_sum=sum-root_node-->value
//missingSelect an option to see the answer and solution.
Q248
Open questionWhich 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
i. Cartesian tree is not a height balanced tree
ii. Cartesian tree of a sequence of unique numbers can be unique generated
Select an option to see the answer and solution.
Q249
Open questionWhich of the following pair's traversals on a binary tree can build the tree uniquely?
Select an option to see the answer and solution.
Q250
Open questionWhat is the time complexity for the update cost on auxiliary trees?
Select an option to see the answer and solution.
Q251
Open questionWhich of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?
Select an option to see the answer and solution.
Q252
Open questionWhat is the prime condition of AA-tree which makes it simpler than a red-black tree?
Select an option to see the answer and solution.
Q253
Open questionHow can you save memory when storing color information in Red-Black tree?
Select an option to see the answer and solution.
Q254
Open questionWhich of the following is incorrect with respect to binary trees?
Select an option to see the answer and solution.
Q255
Open questionWhich node has the lowest priority in a treap?
Select an option to see the answer and solution.
Q256
Open questionWhat is the time complexity for searching k+1 auxiliary trees?
Select an option to see the answer and solution.
Q257
Open questionA treap is a combination of a tree and a heap.
Select an option to see the answer and solution.
Q258
Open questionAn AVL tree is a self - balancing binary search tree, in which the heights of the two child sub trees of any node differ by . . . . . . . .
Select an option to see the answer and solution.
Q259
Open questionWhich type of binary tree does rope require to perform basic operations?
Select an option to see the answer and solution.
Q260
Open questionFor the tree below, write the in-order traversal.
Select an option to see the answer and solution.