CS301 Final Term Searching Quiz Merged

1. If the elements are 3, 5, 1,6in which order they will be removed from the queue one by one

3516

2. The……..of a binary tree is a maximum level of its leaves (also the depth).

height

3. ………of the an empty AVL tree is define to be

Height

4. Following is the keyword of c++

Delete

5. In the perspective of memory organization every process expecting the first part of memory is for…..of the program.

code

6. The……..of a node in a binary tree is define as the height of its left subtree minus height of its right subtree.

balance

7. If p is pointing to a node in an existing tree then info (p)means

Return the content of node p.

8. Following is a keyword of c++……

Delete

9. Every…….tree is a binary search tree

AVL

10. If a function has recursive call as last statement it is known as……

Tail recursive

11. During in a order traversal call if we found a node is null it means this node will satisfy following condition

it will not have left child

12. In binary search tree deleting a node is easy if it is a…… node

Root

13. Which of the following operation returns the content of binary tree node?

Info (p)

14.

15. in a complete binary tree the number of node of level 5 are

16. One should be careful about transient…….that are stored by reference I data structure Objects

17. In a tree we link the node in such a way that it………..a linear structure

does not remain

18. the function call are mode with the help of………..

stack

18. 15 25 45

19. A binary is said to be a……binary tree if every non leaf node in binary tree has non empty left and right structure

Strictly

20. In which of the following function signature the value of variable num cannot be changed in function body

Binary search tree

21. Two common method of simulations are………are…….

Time based simulation and event based simulation

22. Generally there are case (s)to delete a node from BST

23. When a function calls another function the parameters and address of the calling function are put in…

Stock