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.
Define the term process?
Give a brief description of the term Merge Sort?
What are the uses of binary tree?
Describe in brief the word Quick Sort?
Illustrated out briefly the term array. And also write down the types of array operations?
Explain about the spanning Tree?
Define the circular list?
Explain about linked list?
Define cohension and coupling?
Illustrates the Oracle Block? How can two Oracle Blocks have the same address?
18,76,764
1928093 Asked
3,689
Active Tutors
1416835
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!