When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Also checkout these categories
Sitting Arrangement MCQ Algae MCQ Electrical Circuits MCQ Rearrangement Set 7 MCQ Java Programming MCQ Selenium automation MCQ Average MCQ IBPS MCQ Physical Measurement MCQ Rearrangement Set 13 MCQ Origin of Life and Organic Evolution MCQ Choosing the correct sentence MCQ
- The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
- Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
- Herder node is used as sentinel in ____
- Which of the following data structure can't store the non-homogeneous data elements?
- Which of the following data structures are indexed structures?
- ______ is very useful in situation when data have to stored and then retrieved in reverse order.
- Which if the following is/are the levels of implementation of data structure
- The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
- The memory address of fifth element of an array can be calculated by the formula
- When determining the efficiency of algorithm the time factor is measured by
- Arrays are best data structures
- To represent hierarchical relationship between elements, Which data structure is suitable?
- Which of the following statement is false?
- A data structure where elements can be added or removed at either end but not in the middle
- Which data structure is used in breadth first search of a graph to hold nodes?
- The Average case occur in linear search algorithm
- _____ is not the component of data structure.
- Which of the following data structure is linear type?
- Two dimensional arrays are also called
- The complexity of merge sort algorithm is
- Which of the following name does not relate to stacks?
- When determining the efficiency of algorithm, the space factor is measured by
- Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
- Binary search algorithm can not be applied to
- For an algorithm the complexity of the average case is
- Which of the following data structure is not linear data structure?
- If the values of a variable in one module is indirectly changed by another module, this situation is…
- The memory address of the first element of an array is called
- When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
- Which data structure allows deleting data elements from and inserting at rear?