Thursday, 23 November 2017

Basics of Tree: A Non-Linear Data Structure

Tree implies that we organize the data so that sub information are related with each by branches.
Definition of Tree: A Non-Linear Data Structure: 
A tree is a finite set of one or more nodes such that:
1.There is a specially designated node called the root.
2.The remaining nodes are partitioned into (n >= 0) disjoint sets T1,…, Tn, where each of these sets is a tree.  We call T1,…, Tn the sub-trees of the root.

Basics terminology used in Tree data structure:

Root of the tree: The top node of the tree that is not a sub-tree to other node, and has two children of sub-trees.
Node: It is stands for the item of information and the branches to other nodes.
The degree of a node: It is the number of sub-trees of the node.
The degree of a tree: It is the maximum degree of the nodes in the tree.
The parent node: A node that has sub-trees is the parent of the roots of the sub-trees.
The child node: A node that is the roots of the sub-trees are the children of the node.
The Level of the tree: We define the level of a node by initially letting the root be at level one.
The depth of a tree: It also called height of a tree.  It is the maximum level of any node in the tree.

Mukesh Rajput

No comments:

Post a Comment

Mukesh Rajput