CS301 Quiz 3 Lectures 26-33

CS301 PAAn BANA RAS WALA · 2022 #Final-Term · Important NOTE:-

Maybe toppers are successful in school or college carrier but backbenchers are successful in their life because toppers run according to books while backbenchers don’t follow rules and regulation that is why backbenchers are successful. For life, there are no books and another reason why toppers can’t succeed because

they · fear · failure · and · don’t · try · anything

new. Backbenchers don’t fear failure as they have faced the failure in their school or college carrier so that is the reason they try new things and at last gain success.

As Abdul Kalam nicely quoted, “The best brains of the nation may be found on the last benches of the classroom"

Translation into Urdu:

1. When a complete binary tree represented by an array then if right child is at position 5 then left child will be at position ______.

4….confirm

Q2. Which of the following statement is not correct about binary trees, where binary tree traversal are carried out repeatedly?

It is very cumbersome to modify the tree data structure as most of pointer fields are not NULL……confirm

3. When a complete binary tree represented by an array then for any array element at position I, the left child is at position ______.

2i……confirm

4. When a complete binary tree represented by an array then for any array element at position I, the right child is at position ______.

(2i+1)……confirm

5. When a complete binary tree represented by an array then for any array element at position I, the parent is at position ______.

Floor(i/2)….confimr

6. For the inorder traversal of threaded binary tree, we introduced a dummy node. The left pointer of the dummy node is pointing to the ____ node of the tree.

Left most….confirm · 7. Consider a max heap, represented by the following array · 40,30,20,10,15,16,17,8,4