Stack
LIFO
What kind of data structure is Stack?
Ring buffer
Circular Queue is also known as ________
Linked List
A linear collection of data elements where the linear node is given by means of pointer is called?
2h+1 -1
The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is?
25
What is the maximum number of edges in a bipartite graph having 10 vertices?
Infix to postfix conversion
What is the application of stack?
DCBA
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
Pointer to a node
In linked list each node contains a minimum of two fields. One field is data field to store the data second field is?
(n-1)/2
Suppose a binary tree is constructed with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be?
v = e+1
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
Underflow
rear
From which end of the queue elements will be deleted?
ptr = (NODE*)malloc(sizeof(NODE));
Which of the following c code is used to create new node?
n internal nodes
In a full binary tree, every internal node has exactly two children. A full binary tree with 2n+1 nodes contains
Array and Linked list
How do you implement stack?
CPU Scheduling algorithm
What is the application of queue?
Binary search
Linked lists are not suitable for the implementation of ___________
In-order successor
A threaded binary tree is a binary tree in which every node that does not have right child has a thread to it
top