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.
Explain binary tree in brief.
Write down the various types of algorithms?
Write some of the disadvantages of the sequential storage?
Illustrates the memory management in the operating system?
Write down a brief note on the term Huffman algorithm?
Define the term threaded binary tree. Describe its common uses.
Explain how deletion is performed in the binary search tree.
Explain binary tree?
Explain about the threaded binary tree and its common uses.
What is meant by the data design?
18,76,764
1956462 Asked
3,689
Active Tutors
1434533
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!