Name a few tree data structure application.
Answer Posted / 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 |
Post New Answer View All Answers
What is difference between rb tree and avl tree?
Can we apply binary search algorithm to a sorted linked list, why?
Is array faster than arraylist?
What is a treemap used for?
What are the types of linked list?
Explain the difference between hashset and hashmap?
Which interfaces are implemented by hashmap?
Write a program for reversing the Single Linked List?
What is bubble sort technique?
Which is faster array or arraylist?
What are the 4 types of data?
Name few collections map implementations?
Is hashmap ordered?
Which is faster array or linked list?
What happens in insertion sort?