please make sure all of the ans are correct :)

1. Which is NOT belongs to LIST ADT ( ) A. single linked list B. Stack C. pointer D. Queue 2. In a tree, are vertices with no father. ( ) A. children B. root C. adjacent D. leaf 3. Suppose cursor refers to a node in a linked list, What boolean expression will be true when cursor refers to the tail node of the list? ( ) A. (cursor=null) B. (cursor.link == null) C. (cursor.data == null) D. None of the above. 4. For a non-empty singly linked circular list, with h and p pointing to its head and tail nodes, respectively, the TRUE statement is: ( D A. p->next == NULL B. p->next=h C.p==NULL D.p==h 5. The operation for deleting an entry to a queue is traditionally called: ( ) D. pop A. delete B. dequeue C. enqueue 6 The time required in best case for search operation in binary tree is? ( ). A. 0(1) B. O(n) C. O(logn) D. (2n) 7. Which is linear data structure? ( ). A. hash B. stack C. tree D. graph 8. In the linked list implementation of the queue class, where does the enqueue method place the new entry on the linked list? A. At the head B. At the tail C. After all other entries that are greater than the new entry. D. After all other entries that are smaller than the new entry