《leetcode-php》判断一个二叉树是否是对称二叉树

给定一棵二叉树，判断琪是否是自身的镜像（即：是否对称）
思路：按照对称的原则来对比各自对应位置的值

<?php
class Node{
    public $left  = null;
    public $right = null;
    public $val;
    public function __construct($val) {
        $this->val = $val;
    }
}
function isSymmetric($node) {
    return checkSame($node, $node);
}
function checkSame($node1, $node2) {
    if ($node1 == null && $node2 == null) {
        return true;
    }
    return ($node1->val == $node2->val) && checkSame($node1->left, $node2->right) && checkSame($node1->right, $node2->left);
}
$node1 = new Node(1);
$node2 = new Node(2);
$node3 = new Node(2);
$node4 = new Node(3);
$node5 = new Node(3);
$node1->left = $node2;
$node1->right = $node3;
$node3->left = $node4;
$node2->right = $node5;
$ret = isSymmetric($node1);
print intval($ret);