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 |
Explain what are the types of collision resolution techniques and the methods used in each of the type?
What is the best complexity of bubble sort?
How do arrays work?
If you do not initialize an array what will happen?
What is a comparator function?
What is doubly linked list?
What is a treemap used for?
Tell me why might quick sort might be better than merge sort?
What is dynamic array how it is created?
What is the use of substring?
What is unbounded queue?
What is meant by hashing?