The result of Evaluating the post fix expression of 5 4 6 + * 4 9 3 / + * is
Which data structure needed to convert infix notation to postfix notation?
A queue is a -------
The extra key inserted at hte end of the array is called as
The worst case of quick sort has order
The prefix form of an infix expression p + q - r * t is
Which data structure is used for implementing recursion?
Which of the following sorting algorithm is stable?
How many nodes in a Tree have no ancestors?
In Breadth First Search of Graph, which of the following data structure is used?