Define Tree database
Briefly describe the term Tree database. Elucidate its common uses?
Expert
A tree is a data structure that resembles a hierarchical tree structure. Every element in structure is a node. Every node is linked with next node, either to its left or to its right. Each node has zero or more child nodes. The length of longest downward path to leaf from that node is reorganized as the height of the node and the length of the path to its root is reorganized as the depth of a node.
Common Uses:
- To manipulate the hierarchical data - Makes information search, called tree traversal, easier. - To manipulate data which is in the form of sorted list? - To give visual effects for digital images by using as a work flow by compositing them.
Explain the queue operation in brief.
What is Quick Sort?
Does the minimum spanning tree of graph provide the shortest distance between any two specified nodes?
Briefly describe the term linear and non linear data structure?
What are the different between quick and merge sort algorithms?
Write down the differentiation between STACK and ARRAY?
What do you mean by the term matrix? Describe its uses with an illustration.
Describe the term iterative algorithm?
List out the merits and demerits of the term rehashing?
Describe in brief the word Merge Sort?
18,76,764
1952962 Asked
3,689
Active Tutors
1454656
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!