根据给定标准（递归）计算二叉树中的节点

Question

我想使用java中的二叉搜索树递归计算成绩低于60的失败学生的数量。我不知道我的方法是否正确。 在

之后找到要在公共包装器方法中使用的辅助方法

    private int NumberfailStudents(int numoffailed, BNode current) {
        // BaseCase
        if (current == null) {

            return 0 + numofpassed;

        } else {

            if (current.data.getGrades() < 60) {
                return ++numoffailed;
            }

            if (current.left != null) {
                return NumberfailStudents(numoffailed, current.left);
            }
            if (current.right != null) {
                return NumberfailStudents(numoffailed, current.right);
            }

        }

        return numoffailed;

    }

Answer 1

如果检查电流为空的 if 条件应该返回numoffailed 而不是numofpassed

我已更新 NumberFailStudents 以匹配命名约定

    private int NumberFailStudents(int numOfFailed, BNode current) {
        if (current == null)
            return numOfFailed;

        if (current.data.getGrades() < 60)
            ++numOfFailed;

        if (current.left != null)
            numOfFailed = NumberFailStudents(numOfFailed, current.left);

        if (current.right != null)
            numOfFailed = NumberFailStudents(numOfFailed, current.right);

        return numOfFailed;
    }