Question Detail

Preorder is

  • depth first order
  • breadth first order
  • topological order
  • linear order
Similar Questions :

1. O log(n) can be conneted with

  • Selection sort
  • Insertion sort
  • Binary sort
  • Merge sort

2. Preorder is

  • depth first order
  • breadth first order
  • topological order
  • linear order

3. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

4. Which of the following name does not relate to stacks

  • FIFO lists
  • LIFO list
  • Piles
  • Push-down lists

5. Deletion from one end and insertion from other end is

  • stack
  • branch
  • tree
  • queue
Read more from - Data Structure Questions Answers - Chapter 1