Define Tree database
Briefly describe the term Tree database. Elucidate its common uses?
Expert
A tree is a data structure that resembles a hierarchical tree structure. Every element in structure is a node. Every node is linked with next node, either to its left or to its right. Each node has zero or more child nodes. The length of longest downward path to leaf from that node is reorganized as the height of the node and the length of the path to its root is reorganized as the depth of a node.
Common Uses:
- To manipulate the hierarchical data - Makes information search, called tree traversal, easier. - To manipulate data which is in the form of sorted list? - To give visual effects for digital images by using as a work flow by compositing them.
Write down a brief note on the term iterative algorithm?
What are the different between quick and merge sort algorithms?
In a linked list how can I search for data?
Explain an Array is an Ivalue or not.
What is minimum number of queues required to implementing the priority queue?
Illustrates the disadvantages of circular linked list over linear linked list?
Illustrates the use of semaphores for the critical sections of a task?
What are the differences between singly-linked doubly-linked and circularly-linked lists?
Which one data structures used to perform recursion?
Define cohension and coupling?
18,76,764
1960729 Asked
3,689
Active Tutors
1415214
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!