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

Branch and bound algorithm, Suppose we have a set of N agents and a set of ... Suppose we have a set of N agents and a set of N tasks.Each agent can only perform exactly one task and there is a cost associated with each assignment. We would like to find out a

Calculates partial sum of an integer, Now, consider a function that calcula... Now, consider a function that calculates partial sum of an integer n. int psum(int n) { int i, partial_sum; partial_sum = 0;                                           /* L

File organization, Define File organization''s and it''s types Define File organization''s and it''s types

Time complexity, how to learn about time complexity of a particular algorit... how to learn about time complexity of a particular algorithm

Doubly linked list having n nodes, The time required to delete a node x fro... The time required to delete a node x from a doubly linked list having n nodes is O (1)

Pseudo code, since the gregorian calendar was introduced in 1752,a leap yea... since the gregorian calendar was introduced in 1752,a leap year occurs every 4 years.you are to write a pseudo code to find out whether a year is a leap year.your progrm should dis

Explain open addressing, Open addressing The easiest way to resolve a c... Open addressing The easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty location.

Abstract Data Types, A useful tool which is used for specifying the logical... A useful tool which is used for specifying the logical properties of a data type is called the abstract data type or ADT. The term "abstract data type" refers to the fundamental ma

File organization, Define File organization''s and it''s types Define File organization''s and it''s types

Data Warehousing, Assume you are in the insurance business. Find two exampl... Assume you are in the insurance business. Find two examples of Type 2 slowly changing dimensions in that business. As an analyst on the project, write the specifications for applyi