TREE TERMINOLOGY
1.NODE-A tree consists of a finite non-empty set f elements.These elements are stored in nodes.
2.ROOT-The topmost node of tree is called the root of tree.Each tree has a single root.All operations on a tree begin from the root node.
3.EDGE-A line drawn from one node to other successor node is called an edge.An edge is also called a link,a branch or an arc.
4.CHILD-The immediate successor of a node is called child of that node.Each node in a tree may have zero or more child nodes.
5.SIBLING-Two or more nodes at same level and with same parent are called siblings.
6.LEAF-The node with no successor is called a leaf.These nodes are also called terminal nodes.
7.PATH-A path is a sequence of consecutive edges.Edge node in a tree has a unique path.
8.LEVEL-Level is the distance of a node from the root node.The root node has level 0.The level of any other node is one more than level of its parent node.
9.DEGREE OF NODE-Total no. of child nodes of a parent is called degree of the parent node.Degree of a node x is denoted by deg(x).
10.DEGREE OF TREE-Degree of a tree is maximum value out of the degree values of all nodes.
11.DEPTH OF NODE-Depth of a node is the total number of edges from root to that node.
12.DEPTH OF TREE-Depth of a tree is maximum level number of that tree.
2.ROOT-The topmost node of tree is called the root of tree.Each tree has a single root.All operations on a tree begin from the root node.
3.EDGE-A line drawn from one node to other successor node is called an edge.An edge is also called a link,a branch or an arc.
4.CHILD-The immediate successor of a node is called child of that node.Each node in a tree may have zero or more child nodes.
5.SIBLING-Two or more nodes at same level and with same parent are called siblings.
6.LEAF-The node with no successor is called a leaf.These nodes are also called terminal nodes.
7.PATH-A path is a sequence of consecutive edges.Edge node in a tree has a unique path.
8.LEVEL-Level is the distance of a node from the root node.The root node has level 0.The level of any other node is one more than level of its parent node.
9.DEGREE OF NODE-Total no. of child nodes of a parent is called degree of the parent node.Degree of a node x is denoted by deg(x).
10.DEGREE OF TREE-Degree of a tree is maximum value out of the degree values of all nodes.
11.DEPTH OF NODE-Depth of a node is the total number of edges from root to that node.
12.DEPTH OF TREE-Depth of a tree is maximum level number of that tree.
No comments:
Post a Comment