PLSQL中递归树的总结

一、 分层排序ORDER SIBLINGS BY

1 B和C是是亲兄弟，F和G是亲兄弟。注意，D和E不是亲兄弟，最多也就算是堂兄弟，“亲兄弟排序”功能对他们无效。
      A
     / \
    B   C
   /   /
  D   E
 / \
F   G

2.重温一下阐述上图的T表数据
sec@ora10g> select * from t;
X                   Y          Z
---------- ---------- ----------
A                   1
B                   2          1
C                   3          1
D                   4          2
E                   5          3
F                   6          4
G                   7          4

（a）select lpad(' ',level-1)||x tree, SYS_CONNECT_BY_PATH(x,'/') tree_path from t start with x = 'A' connect by prior y=z order siblings by x;

TREE      

      TREE_PATH
---------------- ----------------
A                /A
 B               /A/B
  D              /A/B/D
   F             /A/B/D/F
   G             /A/B/D/G
 C               /A/C
  E              /A/C/E

b）

select lpad(' ',level-1)||x tree, SYS_CONNECT_BY_PATH(x,'/') tree_path from t start with x = 'A' connect by prior y=z order by x;

TREE             TREE_PATH
---------------- ----------------
A                /A
 B               /A/B
 C               /A/C
  D              /A/B/D
  E              /A/C/E
   F             /A/B/D/F
   G             /A/B/D/G