coder_life
The beauty of data structure and algorithm-tree, binary tree, red-black tree
tree Common terms for trees Used to connect to indicate the relationship between adjacent nodes, we call it the parent-child relationship . A Node B node is a parent node , B Node A node is the child node . The parent nodes of the three nodes B, C, and D are the same node, so they are called sibling nodes . We call the node without a parent node the root node , which is the node E in the graph. We call nodes without child nodes as leaf nodes or leaf nodes. For example, G, H, I, J, K, and L in th