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

Write algorithm for searching in a binary tree.

1. if tree is empty, end search
2. If tree is not empty then check the root element.
3. if key== root element , return true.
4. else check if the key is smaller than the root value
5. if smaller then check left sub tree
6. check right sub tree.

Question

Explanation

Write the difference between linear and non-linear data-structure.

A data structure is a linear data structure if its elements are arranged linearly or elements are adjacent to each other eg. Array.
a non-linear data structure is a structure wherein each data element can connect to more than two adjacent data elements. Examples of nonlinear data structure include trees and graphs.