public List<java.util.LinkedList<Integer>> createDepthLinkedLists(TreeNode node){
        if(node==null){
            return null;
        }
        List<java.util.LinkedList<Integer>> linkedListList = new ArrayList<java.util.LinkedList<Integer>>();
        Queue<TreeNode> nodeQueue = new ArrayDeque<TreeNode>();
        nodeQueue.add(node);
        while(!nodeQueue.isEmpty()){
            java.util.LinkedList<Integer> list = new java.util.LinkedList<Integer>();
            Queue<TreeNode> innerQueue = new ArrayDeque<TreeNode>();
            while(!nodeQueue.isEmpty()){
                innerQueue.add(nodeQueue.poll());
            }
            while(!innerQueue.isEmpty()){
                TreeNode currentNode = innerQueue.poll();
                list.add(currentNode.value);
                if(currentNode.left!=null){
                    nodeQueue.add(currentNode.left);
                }
                if(currentNode.right!=null){
                    nodeQueue.add(currentNode.right);
                }
            }
            linkedListList.add(list);
        }
        return linkedListList;
    }