Name a few tree data structure application.
Answer / mamata nayak
Data structure applications are Binary search tree, Syntax tree, Suffix tree, Spanning tree, B-tree, b+tree,Trie tree, Heap tree and K_D tree.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the difference between list and arraylist?
In tree construction which is the suitable efficient data structure?
What is ds heap sort?
Which interface provides the capability to store objects using a key-value pair?
Define b-tree of order m?
Does list allow null values?
How do we search a specific element in an array?
what is the biggest advantage of linked lists?
Differentiate among cycle, path, and circuit?
Which is the fastest sorting?
Explain binary searching, Fibinocci search.
Explain about set and their types in a collection?