Question

Question 8

Consider the tree below. What is the value stored in the parent node of the node containing 30?

14 2 11 1 3 10 30 7 40

Question 8 options:

	10
	11
	14
	40
	None of the above

Question 9

Consider the tree below. How many descendants does the root have?

Question 9 options:

	0
	2
	4
	8

Question 10

Consider the tree below. What is the depth of the tree?

Question 10 options:

	2
	3
	4
	8
	9

Question 11

Consider the tree below. How many children does the root have?

Question 11 options:

	2
	4
	6
	8
	9

Question 12

What is the minimum number of nodes in a complete binary tree with depth 3?

Question 12 options:

	3
	4
	8
	11
	15

Question 13

Select the one true statement.

Question 13 options:

	Every binary tree is either complete or full.
	Every complete binary tree is also a full binary tree.
	Every full binary tree is also a complete binary tree.
	No binary tree is both complete and full.

Question 14

Consider the tree below. What is the order of nodes visited using a pre-order traversal?

Question 14 options:

	1 2 3 7 10 11 14 30 40
	1 2 3 14 7 10 11 40 30
	1 3 2 7 10 40 30 11 14
	14 2 1 3 11 10 7 30 40

Question 15

In the linked list implementation of the queue class, where does the push member function place the new entry on the linked list?

Question 15 options:

	At the head
	At the tail
	After all other entries that are greater than the new entry.
	After all other entries that are smaller than the new entry.

Answer 1

8. For the given free pareer node of 30 is given Illis answer . 1 Só 30 I to 9) descendants refers to . Children, grand children, arc Nodes that are below root is 14 17 . oldescendants 8 nodes f is answer

10) is root The depth of the number of edges from node to ceof node tavo i § 6 30 7 3 edges ř 40 i depth of the depth of of root at aero" F. depth of the =31 root has two children - 11) e D 7 Ž (60o two children 7 grand children : two children is answer

12) At depth o At At depth i depth a 7 one node '') root 7 g nodes ☆ 4 nodes 1. KHI 1+2+4+8+ ct 2 3+1 At depth 3 7 k73 72 -! 21 [15 nodes All options are wrong since beneny the can be wither complete Rob full A binary tree can be full but not complete A binary the can we Complete but not full А на “м е Pet, complete & full

I None of the above correct | The Preordee traversal 4 vinit left subtree y vinit cool Rigur subtree → Vimit right for free root. for Given free 1327 10 40 30 1114. vinit vinit root ceft & rigur childs (Option-c is correer 15) A queue is a FIFO (Firm In fiind out) darastructure . in which new item is insetted at the tail of queue At the tail is answer