In tree construction which is the suitable efficient data structure? (a) Arra

In tree construction which is the suitable efficient data structure?

(a) Array (b) Linked list (c) Stack (d) Queue (e) none

Question Posted / rohit sah

In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list ..

Answer / rohit sah

(b) Linked list

Is This Answer Correct ?

3 Yes

0 No

More Data Structures Interview Questions

Name few classes that implement collection interface?

What is bubble sort used for?

For addition and deletion. Which one is most preferred: array list or linked list?

How do you find the size of an arraylist?

What are the basic operations of stack?

What are the advantages of bubble sort?

What is collision in data structure?

What is m way tree in data structure?

What is a pseudocode example?

If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?

Which is better merge sort or quick sort?

How does the size of arraylist increases dynamically?

For more Data Structures Interview Questions Click Here