leetcode\MaximumDepthOfBinaryTree::maxDepth2()

Complexity

Conditions	6
Paths	7

Size

Total Lines	21
Code Lines	13

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public static function maxDepth2(?TreeNode $root): int
    {
        if (!$root) {
            return 0;
        }
        [$cnt, $queue] = [0, [$root]];
        while ($queue) {
            $size = count($queue);
            while ($size-- > 0) {
                $node = array_pop($queue);
                if ($node->left) {
                    array_push($queue, $node->left);
                }
                if ($node->right) {
                    array_push($queue, $node->right);
                }
            }
            $cnt++;
        }

        return $cnt;
    }