21. The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be . . . . . . . .
22. How many top trees are there in a tree with single vertex?
23. What is the speciality of cartesian sorting?
24. Consider 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 w
What is missing?
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 w25. In which of the following self - balancing binary search tree the recently accessed element can be accessed quickly?
26. Which operation is used to break a preferred path into two sets of parts at a particular node?
27. What 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.
28. Which of the following is not an advantage of trees?
29. What is a full binary tree?
30. Which of the following graph traversals closely imitates level order traversal of a binary tree?
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.