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 |
Why is quicksort so fast?
Difference between abstract data type, data type and data structure?
What is the similarity between a Structure, Union and enumeration?
What is complexity of bubble sort?
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
Construct a doubly linked list using a single pointer in each node?
Can treeset contain duplicates?
Can we insert null in set?
How does a selection sort work for an array?
What is the most used data structure?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is the need for path compression?