Binary Search Trees_B Tree — Part 2 MCQs with Explanations

By counting the number of edges from the root to the node. is the correct answer to “In a Binary Search Tree (BST), how can you find the depth of a particular node”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

To implement dynamic sets and lookup tables. is the correct answer to “What is the typical use case for a Binary Search Tree (BST) in computing”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

Nodes are visited in ascending order. is the correct answer to “What is the result of an inorder traversal of a Binary Search Tree (BST)”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

Insert duplicates into the right subtree or use a counter at each node. is the correct answer to “How do you handle duplicate values in a Binary Search Tree (BST) if duplicates are allowed”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

The number of edges from the node to its deepest descendant. is the correct answer to “In a Binary Search Tree (BST), what does the term "node height" refer to”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

O(d) is the correct answer to “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)”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

No it is not efficient in case of sparse trees and remaning cases it is fine is the correct answer to “Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

can be used in process schedulers, maps, sets is the correct answer to “Which of the following is an application of Red-black trees and why”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

O(log N) is the correct answer to “What is the worst case analysis of an AA-Tree”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

public void inorder(Tree root) { inorder(root.left); System.out.println(root.data); inorder(root.right); } is the correct answer to “Select the code snippet which performs in-order traversal.”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

infinity is the correct answer to “What is the priority of a null node”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

AVL tree store balance factor in every node which costs space is the correct answer to “Why to prefer red-black trees over AVL trees”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

Priority queue is the correct answer to “A self - balancing binary search tree can be used to implement . . . . . . . .”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

right rotation of subtree is the correct answer to “What output does the below pseudo code produces? Tree_node function(Tree_node x) { Tree_node y = x.left; x.left = y.right; y.right = x; return y; }”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

a tree which obeys heap property and whose inorder traversal yields the given sequence is the correct answer to “What is a Cartesian tree”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

Pre-order traversal is the correct answer to “To obtain a prefix expression, which of the tree traversals is used”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

a color which is either red or black and root should always be black color only is the correct answer to “What is the special property of red-black trees and what root should always be”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

S W T Q X U V R P is the correct answer to “Find the postorder traversal of the binary tree shown below.”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

L = I + 1 is the correct answer to “In a full binary tree if number of internal nodes is I, then number of leaves L are”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

True is the correct answer to “Several other operations like union set difference and intersection can be done in treaps.”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

use any tie-breaking rule between repeated elements is the correct answer to “Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

height of left subtree minus height of right subtree is the correct answer to “The balance factor of a node in a binary tree is defined as . . . . . . . .”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

printing ancestors of a node passed as argument is the correct answer to “What is the code below trying to print? void print(tree *root,tree *node) { if(root ==null) return 0 if(root-->left==node || root-->right==node) || print(root->left,node) ||printf(root->right,node) { print(root->data) } }”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

Join is the correct answer to “Which operation is used to combine two auxiliary trees”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

(i-1)/2 is the correct answer to “Using what formula can a parent node be located in an array”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

Cord is the correct answer to “Which of the following is also known as Rope data structure”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

easier to program and faster access to recently accessed items is the correct answer to “Why to prefer splay trees”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

True is the correct answer to “Is Treap a randomized tree.”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

when both left, right nodes are having null pointers and only right node is null pointer respectively is the correct answer to “What are double and single threaded trees”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

All of the mentioned is the correct answer to “Which of the dynamic operations are used in Top Tree data structure implementation”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

O(n log n) is the correct answer to “The binary tree sort implemented using a self - balancing binary search tree takes . . . . . . . . time is worst case.”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

additional value, which is a priority value to the key generated randomly is the correct answer to “A treap is a cartesian tree with . . . . . . . .”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

2 is the correct answer to “How many different shapes does maintenance of AA-Tree need to consider”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

i=i+pow(2,currentlevel); currentlevel=currentlevel+2; j=1 is the correct answer to “What must be the missing logic in place of missing lines for finding sum of nodes of binary tree in alternate levels? //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;) { //present level is initialized to 1 and sum is initialized to 0 for(j=1;j<=pow(2,currentlevel-1);j++) { sum=sum+a[i]; i=i+1; } //missing logic }”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

post-order and pre-order traversal is the correct answer to “A full binary tree can be generated using . . . . . . . .”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

False is the correct answer to “For a binary tree the first node visited in in-order and post-order traversal is same.”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

both dynamic size and ease in insertion/deletion is the correct answer to “Advantages of linked list representation of binary trees over arrays”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

true is the correct answer to “Is the below tree representation of 50, 100,400,300,280 correct way to represent cartesian tree”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

O(d) is the correct answer to “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)”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.

inordersuccessor instead of inorderpredecessor must be done is the correct answer to “What is wrong with below code for inorder traversal of inorder threaded binary tree: inordertraversal(threadedtreenode root): threadedtreenode q = inorderpredecessor(root) while(q!=root): q=inorderpredecessor(q) print q.data”. This question is standard in competitive examination syllabi for Binary Search Trees_B Tree.