In tree construction which is the suitable efficient data structure?
(a) Array (b) Linked list (c) Stack (d) Queue (e) none
Answer Posted / rohit sah
(b) Linked list
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
Can hashmap have same key?
What is the idea behind splaying?
How do you explain bubble sort?
What is a matrix?
Why is quicksort unstable?
Is red black tree balanced?
How does arraylist size work?
How many types of data structures are there?
What are different dynamic memory allocation technique in c.
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
Write the c program to insert a node in circular singly list at the beginning.
Is bucket sort stable?
Define terminal nodes in a tree?
Differentiate between set and map.
What are the tasks performed during preorder traversal?