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.
Write down in brief the working process of Merge Sort?
What is white box testing?
Discuss how to apply queue using stack?
Which is the easiest sorting method to use?
Explain the terms: physical data independence logical data independence
Explain different types of the coupling?
Briefly describe the term threaded binary tree. Elucidate its common uses?
Define the Armstrong rules.
What are the areas wherein data structures are applied extensively?
What is meant by the debugging?
18,76,764
1935711 Asked
3,689
Active Tutors
1421569
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!