When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Correct Answer :
B. FAEKCDHGB
Related Questions
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
Arrays are best data structures
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
The memory address of fifth element of an array can be calculated by the formula
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
None of above
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Stacks linked list
Queue linked list
Both of them
Neither of them
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
The elements of an array are stored successively in memory cells because
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
the architecture of computer memory does not allow arrays to store other than serially
both of above
none of above
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
The Average case occur in linear search algorithm
When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
In linear search algorithm the Worst case occurs when
The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Which of the following is not a limitation of binary search algorithm?
must use a sorted array
requirement of sorted array is expensive when a lot of insertion and deletions are needed
there must be a mechanism to access middle element directly
binary search algorithm is not efficient when the data elements are more than 1000.
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?
mn
max(m,n)
min(m,n)
m+n-1
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
When determining the efficiency of algorithm the time factor is measured by
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
True, False
False, True
True, True
False, False
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
AVL tree
Red-black tree
Lemma tree
None of the above
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above