Data structure- tree, Data Structure & Algorithms

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







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
Related Questions
B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance. A B-

Question 1 Write the different characteristics of an algorithm Question 2 Explain in brief the asymptotic notations Question 3 Write an algorithm of insertion sort and e


need an expert to help me with the assignment

Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

The fundamental element of linked list is a "record" structure of at least two fields. The object which holds the data & refers to the next element into the list is called a node .

There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

A freight train from Melbourne is approaching Sydney, carrying n cars of cargos. The cargos are to be delivered to n different cities in the metropolitan area of Sydney - one car f

Worst Case: For running time, Worst case running time is an upper bound with any input. This guarantees that, irrespective of the type of input, the algorithm will not take any lo

It is a useful tool for indicating the logical properties of data type. It is a collection of values & a set of operations on those values. Methodically, "a TYPE is a set, & elemen