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.
Latest Answer : 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 is not empty. IF FIFO is empty and there is not node ...
Is it possible to implement trees using arrays ? If yes, how?
Latest Answer : Yes, it is possible. Here is an example of implementing a binary tree:Consider an attay : a[n];Place the root in first position. and let the current position to be i = 0;place left node at the position: 2i+1place right node at the position: 2i+2. Repeat ...