Following of Question 8 options:

A) Prints all nodes of linked lists

B) Prints all nodes of linked list in reverse order

C) Prints alternate nodes of Linked List

D) Prints alternate nodes in reverse order

1) A binary search tree whose left subtree and right 5) The number of leaf nodes in a complete binary tree of subtree differ in height by at most 1 is called depth d is A) AVL B) Graph A) 2d B) 2d1+1 C) 2d+1+1 D) 2d+1 C) Heap D) None of the above 6) If G is an directed graph with 20 vertices, how many 2) A binary tree in which every non-leaf node has nonboolean values will be needed to represent G using an empty left and right subtrees is called a strictly binary adjacency matrix? tree. Such a tree with 10 leaves A) 20 B) 40 C) 200 D) 400 A ) Cannot have more than 19 nodes 7) Suppose t is a variable, which expression indicates that t B ) Has exactly 19 nodes represents an empty tree? C ) Has exactly 17 nodes D ) Cannot have more than 17 nodes A) t=NULL B) t> data =0 3) When inorder traversing a tree resulted C) t> data=NULL D) t>left=NULL&&t> right =NULL E A C K F H D B G; 8) What does the following function do for a given Linked the preorder traversal would return List with first node as head? A) FAEKCDBHG B) FAEKCDHGB C) EAFKHDCBG D) FEAKDCHBG void fun1 (struct node* head) \{ if (head == NULL) return; 4) For an undirected graph with n vertices and e edges, fun1 (head->next) ; the sum of the degree of each vertex is equal to A) 2n B) (2n1)/2 C) 2e D) e/2