CS301 Midterm Current Paper 17 dec 2016 2nd Paper
|CS301 Midterm Current Paper|
Here I am going to share Another CS301 paper which was held on 17 december 2016
The questions in CS301 current paper was like:
What is meant by the pre-order traversal of a binary search tree?
Which type of Queue does not support FIFO behavior?
What is menat by : A.height of tree , B.the Balance of Node
Do we Need Current and last current pointers,in addition which head pointer,incase of implement stack by using linked list ? give reason.