Introduction to Tree Data Structure by R4R Team

The hierarchical arrangement of the data is considered as the tree structure.
Unlike Array and Linked List, which are linear data structures, tree is hierarchical (or non-linear) data structure.
Tree is the Non-linear data structure.

Implementation of the tree is possible by both array and Linked list
But linked list is more popular and useful method.

Important Terms:

Path: path refers to the sequence of nodes along the edges of a tree.
Root: The node at the top of the tree is called root.
Parent: Any node except the root node has one edge upward to a node called parent.
Child: The node below a given connected by its edge downward is called node.
Leaf: The node which does not have any child node is called the leaf node.

Types of tree:
Binary Tree
Binary Search Tree
AVL Tree
Complete Binary Tree
Full Binary Tree
Heap Tree
Spanning Tree

Application of Tree :
For representing a city region telephone network.
To represent an image in the form of a bitmap.
To implement the undo function in a text editor.
Your file system is a tree structure.




Leave a Comment:
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!