Tree Level by Level, LinkedList

public ArrayList<LinkedList<TreeNode>> findLevelLinkList(TreeNode root){
int level=0;
ArrayList<LinkedList<TreeNode>> result=new ArrayList<LinkedList<TreeNode>>();
LinkedList<TreeNode> list=new LinkedList<TreeNode>();
list.add(root);
result.add(level,list);
while(true){
list=new ListedList<TreeNode>();
for(int i=0;i<result.get(level).size();i++){
TreeNode n=(TreeNode) result.get(level).get(i);
if(n!=null){
if(n.left!=null) list.add(n.left);
if(n.right!=null) list.add(n.right);
}
if(list.size()>0){
result.add(level+1,list);
}
else{
break;
}
level++;
}
}
return result;
}

public ArrayList<LinkedList<Node>> levelprint(Node root){
ArrayList<LinkedList<Node>> final=new ArrayList<LinkedList<Node>>();
int level=0;
Queue<Node> q=new Queue<Node>();
q.euqueue(root);
while(!q.isEmpty()){
int size=q.size();
LinkedList<Node> list=new LinkedList<Node>();
for(int i=0;i<size;i++){
Node temp=q.pop();
list.add(temp);
if(temp.leftchild)
q.add(temp.left);
if(temp.rightchild)
q.add(temp.right)

}
final.add(level, list);
level++:
}

}