Question Detail Preorder is depth first orderbreadth first ordertopological orderlinear order Answer: Option A Similar Questions : 1. O log(n) can be conneted with Selection sortInsertion sortBinary sortMerge sort Answer: Option C 2. Preorder is depth first orderbreadth first ordertopological orderlinear order Answer: Option A 3. Recursive problems are implemented by queuesstackslinked listsstrings Answer: Option B 4. Which of the following name does not relate to stacks FIFO listsLIFO listPilesPush-down lists Answer: Option A 5. Deletion from one end and insertion from other end is stackbranchtreequeue Answer: Option D Read more from - Data Structure Questions Answers - Chapter 1