树算法

Question

A
                   /      \
                  F        D
                 /\          \
               /    \          \
             /        \          \
            B         C           E
           /\           \            \
         /    \           \            \
       /        \           \            \ 
     G         H            I            J
       \          \           /          /
           \        \       /        /
                 \    \   /    /
                         Z
ID    Step(层次)    name
1          1               A
2          2               F        
3          2               D
4          3               B
5          3               C
6          3               E
7          4               G                    
8          4               H
9          4                I
10         4                J
11         5               Z通过怎么样的算法,来生成这样的表数据

Answer 1

ID    Step(层次)    name           PID
1          1               A       0
2          2               F       1
3          2               D       1
4          3               B
5          3               C
6          3               E
7          4               G                    
8          4               H
9          4                I
10         4                J
11         5               Z建议改一下数据结构，如上所示，增加一个PID，这是比较通用的树结构，其实Step(层次)可以取消，如果你把某个节点的父节点被更改到另外的节点的话，Step(层次)就会带来很大的麻烦

Answer 2

PID的功能是父节点ID，可以规定0代表root