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
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

how to write an algorithm for unions & intersection of two linklists?

Illustrate Trivariate Colour Models Conventional colour models based on the tristimulus theory all contain three variables and so are called trivariate models. Let us now consi

Comparison of Gouraud and Phong Shading Phong shading requires more calculations, but produces better results for specular reflection than Gouraud shading in the form of more r

We have discussed already about three tree traversal methods in the earlier section on general tree. The similar three different ways to do the traversal -inorder , preorder, and p

A B-tree of minimum degree t can maximum pointers in a node T pointers in a node.

System defined data types:- These are data types that have been defined by the compiler of any program. The C language contains 4 basic data types:- Int, float,  char and doubl

algorithm for multiple queue with example program

Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

example of stack using flowchart