Top Data-Structures Interview Questions

Mobiprep handbooks are free downloadable placement preparation resources that can help you ace any company placement process. We have curated a list of the 40 most important MCQ questions which are asked in most companies such as Infosys, TCS, Wipro, Accenture, etc. The placement handbooks also have detailed explanations for every question ensuring you revise all the questions with detailed answers and explanations.

Question

Explanation

Why is it not feasible to implement a queue using array?

The queue has to be constantly extended to make way for more elements that get implemented. Always extending the size of the array will not be feasible as there will be a discrepancy in the creation of the correct array size.

Question

Explanation

What do you mean by stack overflow?.

Stack overflow happens when top = Maxsize – 1
Stack overflow is the term given when the stack is full and an element cannot be inserted into the stack anymore

Question

Explanation

List some applications of tree data structures.

Arithmetic expression handling
Symbol table creation
Lexical analysis
Hierarchical data modeling

Question

Explanation

What is an AVL tree?

AVL tree is a binary search tree in which the difference of heights in left sub tree and right sub tree is not more than 1. This difference is called the Balance Factor.
BalanceFactor = height(left-sutree) − height(right-sutree)