I had following question paper for data structures on 29th Oct, 2007. There were total 10 questions in the engineering paper to be done in 1 hr. I remember only 9 of those:1. A binary search tree was given. Tell the 4th smallest value in it.2. An infix expression was given. Draw a binary tree and write it in prefix/postfix notation.3. A stack has to be implemented. Following methods are given: PUSH[value]...

nirmo420

 Profile Answers by nirmo420 Questions by nirmo420

• Apr 3rd, 2009

Ans for 1: The node number 4 contains the 4th smallest value.

manishmodgil

 Profile Answers by manishmodgil Questions by manishmodgil

• Dec 28th, 2007

First Question's Ans :Create a FIFO list of 4 digits.start from the root of the BST and keep on insrting the nodes in the FIFO till either there is no left subtree of the BST is left and the FIFO ...

Answer Question  Select Best Answer