Data structure Learning--the basic concept of tree

Reference book "Data structure and algorithm analysis--c language description"

Connecting two nodes is called Edge

A tree is a collection of n nodes and N-1 edges

A node without a son is called a leaf (leaf).

Having the same father is called a brother.

The depth of Ni,ni to any node is the only path from Root to Ni, where the depth of the root is 0. The depth of a leaf is equal to its deepest leaf depth.

NI's height is the longest path from ni to a leaf, the height of a tree is higher than its root, and the height of all the leaves is 0.

The length of a path is the number of bars above the path.

The depth of all nodes of a tree and called the internal path is long.

In the tree shown:

The root node of the tree is 20, with 7 nodes and 3 leaf nodes.

The height of node 10 is: 1, the height of the tree is: 3

The depth of node 10 is: 2, the depth of the tree is: 3

the depth of the tree = Tree Height

Data structure Learning--the basic concept of tree