Tree is dynamic data structures. Trees can expand & contract as the program executes and are implemented via pointers. A tree deallocates memory whereas an element is deleted.

Non-linear data structures: Linear data structures contain properties of ordering relationship (can the elements/nodes of tree be sorted?). There is no first or last node. There is no ordering relationship amongst elements of tree.

Items of a tree can be ordered partially into a hierarchy through parent-child relationship. Root node is at the top of the hierarchy & leafs are at the bottom layer of the hierarchy. Therefore, trees can be termed as hierarchical data structures.

Posted Date: 4/10/2013 2:04:10 AM | Location : United States

Ask an Expert

Related Discussions:- Data structure- tree, Assignment Help, Ask Question on Data structure- tree, Get Answer, Expert's Help, Data structure- tree Discussions

Write discussion on Data structure- tree
Your posts are moderated

Write your message here..

Related Questions

Algorithm to add an element at the end of linked list, Write an algorithm t... Write an algorithm to add an element at the end of circular linked list.   Algorithm to Add the Element at the End of Circular Linked List. IINSENDCLL( INFO, LINK, START, A

Define ordinary variable, Ordinary variable An ordinary variable of a e... Ordinary variable An ordinary variable of a easy data type can store a one element only

Insert an element after an element pointed by some pointer, Consider a link... Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer? O (1)

Sparse matrices, SPARSE MATRICES Matrices along with good number of zer... SPARSE MATRICES Matrices along with good number of zero entries are called sparse matrices. Refer the following matrices of Figure (a)

Define queue, A queue is a, FIFO (First In First Out) list. A queue is a, FIFO (First In First Out) list.

#title.state charts., explain two strategies to implement state charts with... explain two strategies to implement state charts with the help of an example of each.

Advantages of first in first out method, Advantages of First in First out (... Advantages of First in First out (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

Linked lists, representation of links list in memory representation of links list in memory

Method to add an element in circular queue, Q. Let us consider a queue is h... Q. Let us consider a queue is housed in an array in circular fashion or trend. It is required to add new items to the queue. Write down a method ENQ to achieve this also check whet

Disadvantages of the lifo costing method, The disadvantages or limitations ... The disadvantages or limitations of the last in first out costing method are: The election of last in first out for income tax purposes is binding for all subsequent yea