61. Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?
62. The balance factor of a node in a binary tree is defined as . . . . . . . .
63. 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)
}
}
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)
}
}64. Which operation is used to combine two auxiliary trees?
65. Using what formula can a parent node be located in an array?
66. Which of the following is also known as Rope data structure?
67. Why to prefer splay trees?
68. Is Treap a randomized tree.
69. What are double and single threaded trees?
70. Which of the dynamic operations are used in Top Tree data structure implementation?
Read More Section(Binary Search Trees(B Tree))
Each Section contains maximum 100 MCQs question on Binary Search Trees(B Tree). To get more questions visit other sections.