Q. Binary search tree has best case run-time complexity of Ο(log n). What could the worst case?

View solution

Q. In order traversal of binary search tree will produce −

View solution

Q. In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?

View solution

Q. If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

View solution

Q. The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is ?

View solution

Q. Which method can find if two vertices x & y have path between them?

View solution

Q. Access time of a binary search tree may go worse in terms of time complexity upto

View solution

Q. Visiting root node after visiting left and right sub-trees is called

View solution

Q. In the deletion operation of max heap, the root is replaced by

View solution

Q. All possible spanning trees of graph G

View solution

Q. Binary search tree is an example of complete binary tree with special attributes.

View solution

Q. Maximum number of nodes in a binary tree with height k, where root is height 0, is

View solution

Q. In a min heap

View solution

Q. Re-balancing of AVL tree costs

View solution

Q. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ……

View solution

Q. Herder node is used as sentinel in …..

View solution

Q. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

View solution

Q. The property of binary tree is

View solution

Q. State true or false.

i) The degree of root node is always zero.

ii) Nodes that are not root and not leaf are called as internal nodes.

View solution

Q. Any node is the path from the root to the node is called

View solution