71. The binary tree sort implemented using a self - balancing binary search tree takes . . . . . . . . time is worst case.
72. A treap is a cartesian tree with . . . . . . . .
73. How many different shapes does maintenance of AA-Tree need to consider?
74. 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
}
//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
}75. A full binary tree can be generated using . . . . . . . .
76. For a binary tree the first node visited in in-order and post-order traversal is same.
77. Advantages of linked list representation of binary trees over arrays?
78. Is the below tree representation of 50, 100,400,300,280 correct way to represent cartesian tree?
/1725256793-62-2.png "Binary Search Trees(B Tree) mcq question image")
79. 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)
80. 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
inordertraversal(threadedtreenode root):
threadedtreenode q = inorderpredecessor(root)
while(q!=root):
q=inorderpredecessor(q)
print q.dataRead 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.