leedcode_100. 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.

Subscribe to see which companies asked this question.

题目简单，递归的一个调用遍历一遍树就好了。qp同时遍历，不同就返回。

代码：

/** * Definition for a binary tree node. * 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 1;        }        if(p == NULL || q == NULL){            return 0;        }        if(p->val == q->val){            return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);        }        if(p->val != q->val){            return 0;        }        return 1;    }};