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

What are expression trees, What are expression trees?  The leaves of an... What are expression trees?  The leaves of an expression tree are operands, like as constants or variable names, and the other nodes have operators. This certain tree happens to

Algorithm to build a binary tree , Q. Give the algorithm to build a binary ... Q. Give the algorithm to build a binary tree where the yields of preorder and post order traversal are given to us.

Values are automatically assigned to those array elements, What values a... What values are automatically assigned to those array elements which are not explicitly initialized? Garbage values are automatically assigned to those array elements that

Avl tree, Example: (Single rotation into AVL tree, while a new node is inse... Example: (Single rotation into AVL tree, while a new node is inserted into the AVL tree (LL Rotation)) Figure: LL Rotation The rectangles marked A, B & C are trees

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)

Write a program to create a heap file, Write a program to create a heap fil... Write a program to create a heap file that holds the records in the file " data_2013 " The source records are variablelength.However, the heap file should hold fixed-length reco

Doubly linklist, explanation of doubly linklist explanation of doubly linklist

C++, 7. String manipulation 7.a Write a C Program using following strin... 7. String manipulation 7.a Write a C Program using following string manipulation functions a) strcpy b) strncpy c) strcmp d) strncmp e) strlen f) strcat

Sorting algorithm, Sorting Algorithm A sorting algorithm is an algorit... Sorting Algorithm A sorting algorithm is an algorithm which puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Eff

Darw a flowchart to input 3 numbers, This algorithm inputs 3 numbers, every... This algorithm inputs 3 numbers, every number goes through successive division by 10 until its value is less than 1. An output is produced which comprise the number input and a val