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 is meant by the data design?
Briefly describe the term queue operation?
What are the differences between data structure of System R and the relational structure?
Explain about the priority queue?
List the areas in that data structures are applied extensively?
Define the term Linear and non-linear data structure.
Briefly explain the term binary tree? Elucidate its uses?
Minimum number of queues required implements the priority queue?
Illustrates the stack operation in briefly?
Explain about the Huffman algorithm.
18,76,764
1937547 Asked
3,689
Active Tutors
1418080
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!