http://www.oschina.net/question/572366_235443?fromerr=kI0toIyF

Folder有如下属性：id,pid(父节点)，sequence(同级节点排序依据)
有如下数据：
F1 (1,0,1)
F2 (2,0,2)
F3 (3,4,1)
F4 (4,2,1)
F5 (5,1,1)
F6 (6,1,2)
F7 (7,6,1)
F8 (8,0,3)
树形结构为：
(1,0,1) F1
(5,1,1)      F5

(6,1,2)      F6

(7,6,1)           F7

(2,0,2) F2
(4,2,1)        F4

(3,4,1)           F3
(8,0,3) F8
怎么实现对以上数据以sequence大小为依据进行排序，实现按树形结构输出
    F1、F5、F6、F7、F2、F4、F3、F8


import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class FolderTree
{

    public static void main(String[] args)
    {
        int[] F1 = { 1, 0, 1 };
        int[] F2 = { 2, 0, 2 };
        int[] F3 = { 3, 4, 1 };
        int[] F4 = { 4, 2, 1 };
        int[] F5 = { 5, 1, 1 };
        int[] F6 = { 6, 1, 2 };
        int[] F7 = { 7, 6, 1 };
        int[] F8 = { 8, 0, 3 };
        
        List<int[]> list = new ArrayList<int[]>();
        list.add(F1);
        list.add(F2);
        list.add(F3);
        list.add(F4);
        list.add(F5);
        list.add(F6);
        list.add(F7);
        list.add(F8);
        
        LinkedList<int[]> result = new LinkedList<int[]>();
        LinkedList<int[]> f = sort(list, result, 0);
        for(int i = 0; i < f.size(); i++)
        {
            System.out.print(f.get(i)[0] + ",");
            System.out.print(f.get(i)[1] + ",");
            System.out.println(f.get(i)[2]);
        }
    }

    private static LinkedList<int[]> sort(List<int[]> list , LinkedList<int[]> result, int father)
    {
        List<int[]> temp = new ArrayList<int[]>();
        
        for(int i = 0; i < list.size(); i++)//最高层,临时存放
        {
            if(list.get(i)[1] == father)
            {
                temp.add(list.get(i));
            }
        }
        
        if(temp.size() < 1)
        {
            return result;
        }
        else//递归
        {
            for (int j = 0; j < list.size(); j++) //删除最高层
            {
                if (list.get(j)[1] == father)
                {
                    list.remove(j);
                }
            }
            
            for (int i = 0; i < temp.size() - 1; i++) //对最高层排序
            {
                for (int j = i + 1; j < temp.size(); j++)
                {
                    if (temp.get(i)[2] > temp.get(j)[2])
                    {
                        int [] t = temp.get(i);
                        temp.set(i, temp.get(j));
                        temp.set(j, t);
                    }
                }
            }
            
            for (int i = 0; i < temp.size(); i++)
            {
                result.add(temp.get(i));
                sort(list, result, temp.get(i)[0]);
            }
            return result;
        }
        
    }
}



js算法

function sortTree(records,result,father){
    var temp = [];
    for(var i = 0; i < records.length; i++) {
        var nodeValue = records[i];
        var pId = Number(nodeValue [4]);
        if(pId == father) {
            temp.push(records[i]);
        }
    }
    if(temp.length < 1) {
        return result;
    }else {
        for (var j = 0; j < records.length; j++) {
            if (records[j] == father) {
                var reTemp=[];
                for (var k = 0; k < records.length; k++){
                    if(k!=j){
                        reTemp.push(records[k]);
                    }
                }
                records=reTemp;
            }
        }
        for (var i = 0; i < temp.length; i++) {
            result.push(temp[i]);
            var nodeValue = temp[i];
            var id = Number(nodeValue [0]);
            sortTree(records,result, id);
        }
        return result;
    }
}