某一深度上所有结点的链表

package com.NodePair;
import java.util.LinkedList;
import java.util.ArrayList;


import javax.swing.tree.TreeNode;
public class CreateLinkedList {


ArrayList<LinkedList<TreeNode>> CreateLinkList(TreeNode root)
{
ArrayList<LinkedList<TreeNode>> result=new ArrayList<LinkedList<TreeNode>>();
LinkedList<TreeNode> current= new LinkedList<TreeNode>();
if(root!=null)
{
current.add(root);
}
while(current.size()>0)
{
result.add(current);
LinkedList<TreeNode> parents=current;
current=new LinkedList<TreeNode>();
for(TreeNode parent:parents)
{
if(parent.left!=null)
{
current.add(parent.left);
}
if(parent.right!=null)
{
current.add(parent.right);
}

}
}
return result;

}
}