Tree: a binary search tree
Others
2019-09-09 16:12:43
views: null
- Root (Root) : topmost node in the tree, the root node has no parent.
- Child node (Child) : the root node has a child node is called a sub-tree of the node.
- Parent (the Parent) : If the node has a child node, the node is the parent node child nodes.
- Sibling (Sibling) : with node node has the same parent node.
- Descendant node (Descendant) : a downward path up to node node.
- Leaf (Leaf) : node has no child nodes.
- The node (the Node Internal) : at least one child node of the node.
- Degree (Degree) : node has a number of sub-tree.
- Edge (Edge) : linking two nodes in the middle.
- Path (the Path) : the sequence from node to node during the descendant nodes and edges thereof.
- Level (Level) : Level 0 is a root level, child of the root level is Level 1, and so on.
- Height (Height) / depth (Depth) the number of layers in the tree: For example only Level 0, Level 1, Level 2 is 3 are highly.
Origin www.cnblogs.com/chentianwei/p/11490587.html