必須看看學習一下代碼，！！！！！！ 可以的這一題！！
/** * 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 is(TreeNode* t1, TreeNode* t2){ if(t1 == NULL && t2 == NULL) return true; if(t1 == NULL || t2 == NULL) return false; return (t1 -> val == t2 -> val) && is(t1 -> left, t2 -> right) && is(t1 ->right, t2 -> left); } bool isSymmetric(TreeNode* root) { return is(root, root); }};新聞熱點
疑難解答
