DATA STRUCTURES INTERVIEW QUESTIONS AND ANSWERS
(Q) When I can call it complete Binary Tree?
(A) It is said to be complete when each node that has a right child also has a left child. Having a left child does not require a node to have a right child. Alternate Binary tree is a tree where their is always a left node for right node but may be may not be right node for left node.
(Q) What is AVL tree?
(A) AVL tree is self balancing tree, in which balancing factor lie between the -1 to 1.
(Q)How can I find the number of possible tree in the given tree?
(A) Number of possible tree = (2 power of n) – n
(Q) What is Hashing?
(A) Hashing is a technique to retrieve records from memory quickly.
(Q) What is difference between linear and non linear data structures?
(A) Linear data structures are data structures whose data are in linear. eg: Arrays
Non linear are data structures whose data are non linear format. eg: Trees
(Q) List the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
(A) Polish and Reverse Polish notations.
(Q) Can I use Selection method to for sorting?
(A) Yes, Selection method is used for Selection sort.
