HR30 Day 22: Binary Search Trees 문서 원본 보기

==개요==
;<nowiki>HR30 Day 22: Binary Search Trees</nowiki>
* https://www.hackerrank.com/challenges/30-binary-search-trees/problem

{{HR30 헤더}}
{{HR30 20-29}}
|}

==Java==
{{참고|HR30 Day 22: Binary Search Trees/Java}}
<syntaxhighlight lang='Java'>
    public static int getHeight(Node root){
        //Write your code here
        if( root == null ) return -1;
        int left = getHeight(root.left);
        int right = getHeight(root.right);
        return Math.max(left, right) + 1;
    }
</syntaxhighlight>

==PHP==
{{참고|HR30 Day 22: Binary Search Trees/PHP}}
<syntaxhighlight lang='PHP'>
    public function getHeight($root){
        //Write your code here
        if( is_null($root) ) return -1;
        $left = $this->getHeight($root->left);
        $right = $this->getHeight($root->right);
        return max($left, $right)+1;
    }
</syntaxhighlight>