data structures c language

1) A binary search tree whose left subtree and right subtree differ in height by at most 1 is called A) AVL B) Graph C) Heap D) None of the above 2) A binary tree in which every non-leaf node has noncmpty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves A ) Cannot bave more than 19 nodes B) Has exactly 19 nodes C) Has exactly 17 nodes D) Cantor hive more than 17 nodes 3) When inorder traversing a tree resulted EACKFHDBG: the preonder traversal would returm A) FAEKCDBHG B) FAFKCDHGB C) EAFKHDCBG D) FEAKDCHBG 4) For an undirected griph with n vertices and e edges, the sum of the degree of each vertex is equal to A) 2n B) (2n1)/2 C) 2e D) e/2 5) The number of leaf nodes in a complete binary tree of depth d is A) 24 B) 231+1 C) 22+1+1 D) 2d+1 6) If G is an directed grapt with 20 vertices, how many boolean values will be needed to represent G using an adjacency matrix? A) 20 B) 40 C) 200 D) 400 7) Suppose t is a variable, which expression indicates that t represents an empty tree? A) t= NUL. 1 . B) 1stata=0 C) t data=NULI. D) left-NULLAA right NULL. 8) What does the following function do for a given L.inked List with fint node as head? void funs (stroct node * bead) ( if (head = Nuth) retion! funt (tiead-yne x t) ? printf("ta ", head-zdata)? i A) Prints all nodes of linked tists B) Prints all nodes of linked list in revene order C) Prints altemate nodes of Linked L ist D) Prints aliemate nodes in revene order 9) What is the result of the following string expression 48+6/344+6 A) 14 B) 6 C)8 D)12 10) What is the preonder treversal of the new tree affer data 18 is deleted? A) 471024132132 B) 132132241074 C) 104724132132 D) none of them 11) Which data structure is needed to convert infix notation to postfix notation? A. Branch B. Queue C. Tree D. Stack 12.) Which of the following dati structure is tinear data structure? A. Trees B. Graphs C. Linked Lints D. None of abxive 13-) Inorder traversal of binury search tree will produce A. unvorted list B. reverse of input C. sorted list D. none of the above 14-) A queue is as A. FIFO (First In First Out) list. B. Ondernd amry; C. UFO (Last in First Our) list. D. Linear tree 15-) Which of the following operations is perforned more efficiently by doubly linked list than by singly tinked tiar A. Deleting a node whose location in given B. Searching of an unsorted list for a given iten C. Inserting a new node to the fromt of the list D. Traversing the list in forward direction 16-) The postix form of (A+B)(CDB)F/G is A. AB+CDEFG/ B. AB+CDEF+G/ C. AB+CDEFG ! D. AB+CDEFG / 17-) Stack is work on the principal of A. 1no B. FIFO C. 20R0 D. LIFO 18-) Under which condition circular queve is Full if cnt is not used A. Front -1 B. Froet-(tear+1) himaxsize C. Front-(front+1) Mimaxize D. Rear-(reirt1) Wimareint 19-) What is the output of the following code? Int values 5={5,3,8,7,11}; stack as intetaifte\{st\}; for fint 1=0;1