Tag: Data Structures and Algorithms Mcq

(A) Use better data structures
(B) Increase the hard disk space
(C) Use the better algorithm
(D) Use as much data as we can store on the hard disk

(A) Linked list
(B) Stack
(C) Queue
(D) Tree

(A) Post-order
(B) Level-order
(C) Inorder
(D) None of the above

(A) Randomly
(B) That occur first in the text message
(C) That are lexically smaller among others
(D) That are lexically greater among others

(A) Linear
(B) Exponential
(C) Polynomial
(D) None of the above

(A) Right thread of the right-most node points to the dummy node
(B) Left thread of the left-most node points to the dummy node
(C) The left pointer of dummy node points to the root node of the tree
(D) Left thread of the right-most node points to the dummy node

(A) A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor
(B) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor
(C) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor
(D) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor

(A) Only one rotation
(B) Rotation at each non-leaf node
(C) Rotation at each leaf node
(D) Rotations equal to log2 N