Q. ......................is called self referential structure.

View solution

Q. The time complexity for evaluating a postfix expression is

View solution

Q. Dequeue is called

View solution

Q. Consider the following complete binary tree and find out the height of the tree

View solution

Q. In a tree construction which one will suitable and efficient data structure?

View solution

Q. Which of following is not true about spanning tree?

View solution

Q. B–tree of order M is a tree having which of the following structural property?

View solution

Q. In a max heap both the addition and deletion operations can be performed in time

View solution

Q. Binary tree can be represented as

View solution

Q. Pre-order of A*(B+C) /D-G is

View solution

Q. Which of the following will have efficient space and time complexities?

View solution

Q. The worst case height of AVL tree with n nodes is

View solution

Q. The worst case complexity for searching an element in a binary search tree is

View solution

Q. The following sequence are inserted into a binary search tree:
6 10 25 12 4 7 15 8 33
What is the type of traversal given by: 6 4 10 7 25 8 12 33 15

View solution

Q. The running time of building MAX – HEAP is

View solution

Q. Which of the following sorting algorithm has average sorting behaviour

View solution

Q. The implementation of priority queue is

View solution

Q. If there are n elements in the heap, what is the time complexity of inserting new element in the heal in worst case?

View solution

Q. If a binary search tree traversed in order then numbers of the nodes will printed in

View solution

Q. In binary search tree which traversal is used for getting ascending order values?

View solution