https://oj.leetcode.com/problems/same-tree/
判断两个二叉树,是否相等。
深搜
/** * 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; if(p == NULL || q == NULL) return false; if(p->val != q->val) return false; bool ret = isSameTree(p->left,q->left); if(ret == false) return false; bool ret2 = isSameTree(p->right,q->right); if(ret2 == false) return false; return true; } };