Explain the term Tree database
Explain the term Tree database. Describe its general uses.
Expert
A tree is a data structure that resembles a hierarchical tree structure. Each and every element in the structure is a node. Each and every node is linked with the next node, either to its left or to its right. Each and every node consists of zero or more child nodes. The length of longest downward path to a leaf from that node is termed as the height of the node and the length of the path to its root is termed as the depth of node.
Its general uses are as follows:
a) To manipulate the hierarchical data
b) Makes the information search, termed tree traversal, simpler.
c) To manipulate data this is in the form of sorted list.
d) To provide visual effects for digital images by using as a work-flow by compositing them.
What are the main uses of data structures?
Elucidate any two merits using Single linked list over doubly linked list and vice-versa?
Explain about the spanning Tree?
What is the application of tree data-structure?
Explain about the threaded binary tree and its common uses.
Explain Tree database briefly.
Explain how spiral model works?
When should we use Space in linked list instead of an array or vice versa?
Describe the Quick sort algorithm.
Illustrate the difference between the stack and Queue in brief?
18,76,764
1937699 Asked
3,689
Active Tutors
1425979
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!