/**
*臨時寫的偽代碼
*/
//獲取第N級的所有節點
public list getTreeLeverNode(int lever)
??rs0 = select id from menu where parentid is null;? //先從數據庫取出第一級的所有節點
??if(lever<=1)
? return rs0
? //循環第一級的節點遞歸取下面的節點
??for(int i=0; i<rs0.length; i++){
???rslist = getNextNode(rs0[i],lever-1);
???list.add(rslist);
??}
??return rs1;
}
public list getNextNode(int reqParentid,int lever){
??rs2 = select id from menu where parentid = reqParentid;
??lever = lever -1;
??if(lever>0){
???for(int i=0; i<rs2.length; i++){
????rs2 = getNextNode(rs2[i],lever);
????list.add(rs2);
???}
??}
??return rs2;
}