In tree construction which is the suitable efficient data structure? – McqOptions

MCQOPTIONS

1.	In tree construction which is the suitable efficient data structure?
A.	Array
B.	Linked list
C.	Stack
D.	Queue
Answer» C. Stack

Discussion

No Comment Found

Related MCQs

Mark the best option: The declarations typedef float height [100]; height men, women;
Predict the output of following program fragment main ( ) { float balance, loan; balance =1000.0; loan = balance/10; if ((balance > 500) && ( loan < 500)) printf(“good account \n"); if((balance < 500) || (loan < 500)) printf(“caution ! \n"); }
Pulse stuffing is a strategy used in________________________.
Choose the proper statement
The function that actually created from a call to a template function is called
In tree construction which is the suitable efficient data structure?