leetcode\MinimumDepthOfBinaryTree

Complexity

Total Complexity

4

Size/Duplication

Total Lines	13
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	minDepth()	0	11	4

<?php

declare(strict_types=1);

namespace leetcode;

use leetcode\util\TreeNode;

class MinimumDepthOfBinaryTree
{
    public static function minDepth(TreeNode $root = null): int
    {
        if (!$root) {
            return 0;
        }
        $left = self::minDepth($root->left);
        $right = self::minDepth($root->right);

        return ($left === 0 || $right === 0)
            ? $left + $right + 1
            : min($left, $right) + 1;
    }
}