ツリーの深さの再帰と非再帰のアルゴリズムを求めます

再帰アルゴリズム

public static int heightOfBinaryTreeInRecursion(BinaryTreeNode root){ //            
        int leftHeight,rightHeight;
        if(root == null)
            return 0;
        leftHeight = heightOfBinaryTreeInRecursion(root.getLeft());
        rightHeight = heightOfBinaryTreeInRecursion(root.getRight());
        if(leftHeight > rightHeight)
            return (leftHeight+1);
        else 
            return (rightHeight+1);
    }

非再帰アルゴリズム

public static<T> int heightOfBinaryTree(BinaryTreeNode<T> root){ //             
        if(root == null)
            return 0;
        DynArrayQueue<BinaryTreeNode<T>> queue = new DynArrayQueue<>();
        queue.enQueue(root);
        queue.enQueue(null); //        
        int count = 0; //    
        while(!queue.isEmpty()){
            root = queue.deQueue();
            if(root == null){ //       
                if(!queue.isEmpty()) //         
                    queue.enQueue(null);
                count++;
            } else {
                if(root.getLeft() != null)
                    queue.enQueue(root.getLeft());
                if(root.getRight() != null)
                    queue.enQueue(root.getRight());
            }
        }
        return count;
    }

完全なコードは私のGitHubにアクセスできます.https://github.com/StriverLi/Data-Structures-and-Algorithms-in-Java/blob/master/src/tree/BinaryTreeNode.java