CS301 Current Midterm Paper Fall 2013 File 1

CS301 Today's Paper by Saifi

21.what is the difference between "call by value" and "call by reference".

22.How to delete a node in a binary search tree. The node has two child nodes.

23.Write in Traverse Implementation. The tree with 4 nodes was given.

24.Cpp code was given and we have to tell the output of the code.

25.A tree was given and we have to write the Nodes in In-order and Pre-order Traverse form.

26.Cpp code was given and we have to correct the code.