Data structure, part 3
Tree structureA tree structure is a data structure that expresses the hierarchical relationshipbetween elements. It is suitable for expressing relationships branchedbetween data.node:Area for storing data.(Element part of the tree structure)branch:Line connecting the node.(Connect elements)root node:The first node without a parent node.leaf node:Terminal node without a child node.In addition, there are several types of tree structures, so I will introduce them.(1)Binary treeA binary tree is a tree that has two or less children in each node. Distinguishthe two children like the left child and the right child, respectively. The partrooted on the left child is called the left subtree, and the p
0