# Other Data Structures Interview Questions

Question what is binary tree? Parenthesis are never needed in prefix or postfix expressions. Why? What is B+ tree? Explain about the types of linked lists What does abstract data type means? Stack can be described as a pointer. Explain. The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g)) Tell me real world example of polymorphism and encapsulation . ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm What are the parts of root node? what is a complexity of linear search,binery search? A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute? Which data structure is needed to convert infix notations to post fix notations? what is mean by d-queue? How will inorder, preorder and postorder traversals print the elements of a tree? difference between the run time polymorphism and Asked @ BMC Microsoft BMC TCS Wipro MorganStanley Answers 11 10 4 5 14 4

9

CTS

3

ABB

15

Microsoft CybAge

25 2 1

BMC

7 1 10

Fidelity

19 6 11

CybAge

1

which need brackets based on BODMAS rule to understand the order of execution. Re: Parenthesis are never needed in prefix or postfix expressions. The conversion and evaluation of postfix and prefix are applications of stack model.e. Last in First out.These maintained with the help of Stack i. So we parenthesis in prefix and postfix notions. Fibinocci search. The postfix or prefix are machine-readable format. Whereas we have already taken the consideration of order of operands during the time of conversion to prefix or postfix form. is useful in execution of orders are donot need Evaluation of postfix or prefix notations are done with the help of stacks. In other words. Why? Answer Parenthesis are used to define the sequence or # 5 priority of execution of operations which infix notation. So there is no need for brackets. infix notation is human-readable format.compile time poly morphism and about virtual function. . Explain binary searching.

Sign up to vote on this title