(A) Binary tree
(B) Binary search tree
(C) Parse tree
(D) AVL tree
Tag: Data Structure Mcqs
The difference between a binary tree and a binary search tree is that?
(A) A binary search tree has two children per node whereas a binary tree can have none, one, or two children per node
(B) In binary search tree nodes are inserted based on the values they contain
(C) In binary tree nodes are inserted based on the values they contain
(D) None of the above
A Compound Data Structure is the data structure which can have multiple data items of same type or of different types. Which of the following can be considered compound data structure?
(A) Arrays
(B) Link Lists
(C) Binary Search Trees
(D) All of the given options
Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What statement changes currentNode so that it refers to the next node?
(A) currentNode ++;
(B) currentNode = nextNode;
(C) currentNode += nextNode;
(D) currentNode = currentNode->nextNode;
If numbers 5, 222, 4, 48 are inserted in a queue, which one will be removed first?
(A) 4
(B) 5
(C) 48
(D) 222
Merge sort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?
(A) Elements in the first half of the array are less than or equal to elements in the second half of the array
(B) The array elements form a heap
(C) Elements in the second half of the array are less than or equal to elements in the first half of the array
(D) None of the above
The __ method of list will position the currentNode and lastCurrentNode at the start of the list.
(A) Remove
(B) Next
(C) Start
(D) Back
A binary tree with 33 internal nodes has __ links to internal nodes.
(A) 31
(B) 32
(C) 33
(D) 66