| Other Data Structures Interview Questions |
|| Asked @
|Convert the following infix expression to post fix notation
|| ||9 |
|How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
|Explain binary searching, Fibinocci search.
|applications of stacks and their uses?
|What is the average number of comparisons in a sequential
|| ||4 |
|How will inorder, preorder and postorder traversals print
the elements of a tree?
|| ||11 |
|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?
|simple algorithm for bubble sort?
|| ||1 |
|how to find the number of possible tree in the given tree.
|what is mean by d-queue?
|| ||10 |
|What does abstract data type means?
|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?
|For more Data Structures Interview Questions Click Here |