Degree of tree

Height of tree

Marks: 3 M

Year: May 2015

Degree of tree

The degree of a node is the number of partitions in the subtree which has that node as the root.

Nodes with degree 0 are called leaves.

The degree of a tree is the degree of the root node.

For example, the degree of a binary tree is 2, since a root node can have 2 children.

Height of tree

The height of a node is the length of the longest downward path between the node and a leaf node.

The height of a tree is the height of the root node.

For example, the height of the following tree is 4 (A-B-E-H-I).

Figure 2: Height of the tree is 4