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.
Does the minimum spanning tree of graph provide the shortest distance between any two specified nodes?
Describe the term two-dimensional array by using example?
Explain the disadvantages of the array implementations of linked list?
Briefly describe the term merge sort algorithm?
Explain about the priority queue?
What is meant by the data design?
Explain about the process management of operating system.
Define how to implement queue by using stack?
Explain when AVL tree property is violated and describe how to solve it?
What is win-win spiral model?
18,76,764
1922229 Asked
3,689
Active Tutors
1429279
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!