Home

When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

A. FAEKCDBHG

B. FAEKCDHGB

C. EAFKHDCBG

D. FEAKDCHBG

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  2. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  3. Herder node is used as sentinel in ____
  4. Which of the following data structure can't store the non-homogeneous data elements?
  5. Which of the following data structures are indexed structures?
  6. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  7. Which if the following is/are the levels of implementation of data structure
  8. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  9. The memory address of fifth element of an array can be calculated by the formula
  10. When determining the efficiency of algorithm the time factor is measured by
  11. Arrays are best data structures
  12. To represent hierarchical relationship between elements, Which data structure is suitable?
  13. Which of the following statement is false?
  14. A data structure where elements can be added or removed at either end but not in the middle
  15. Which data structure is used in breadth first search of a graph to hold nodes?
  16. The Average case occur in linear search algorithm
  17. _____ is not the component of data structure.
  18. Which of the following data structure is linear type?
  19. Two dimensional arrays are also called
  20. The complexity of merge sort algorithm is
  21. Which of the following name does not relate to stacks?
  22. When determining the efficiency of algorithm, the space factor is measured by
  23. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  24. Binary search algorithm can not be applied to
  25. For an algorithm the complexity of the average case is
  26. Which of the following data structure is not linear data structure?
  27. If the values of a variable in one module is indirectly changed by another module, this situation is…
  28. The memory address of the first element of an array is called
  29. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  30. Which data structure allows deleting data elements from and inserting at rear?