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 pre-order and in-order tree traversal.
What are the different between quick and merge sort algorithms?
Illustrates the difference between ARRAY and STACK?
Define the term Arrays in brief?
Explain different types of the coupling?
Explain whether the fact table is in normal form or not?
Define how to implement queue by using stack?
What do you mean by the term matrix? Describe its uses with an illustration.
What is the way to implement of deletion from a binary tree?
What is the relation between Doubly Linked List and Circular Linked List?
18,76,764
1937581 Asked
3,689
Active Tutors
1437062
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!