★leetcode★ same-tree

 

 

题目要求：

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

判断两棵二叉树是否相等

解题思路：

递归思想（好像大多数关于二叉树的题目都可以用递归来解决）

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode *p, TreeNode *q)
    {
        if(p == NULL && q == NULL)
            return true;
        else if(p == NULL || q == NULL)
            return false;

        if(p->val == q->val)
        {
            return (isSameTree(p->left, q->left) && (isSameTree(p->right, q->right)));
        }
        return false;



    }
};