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; the preorder traversal would return 8) What does the following function do for a given Linked A) FAEKCDBHG B) FAEKCDHGB C) EAFKHDCBG D) FEAKDCHBG List with first node as head? 4) For an the sum A) 2n void fun1(struct node* head) i if (head == NULL) return; A) Prints all nodes of linked lists A. Deleting a node whose location in given B) Prints all nodes of linked list in reverse order B. Searching of an unsorted list for a given item C) Prints alternate nodes of Linked List C. Inserting a new node to the front of the list D) Prints alternate nodes in reverse order D. Traversing the list in forward direction