# 101. Symmetric Tree

## 1.問題 

* 給予一個binary tree, 判斷是否為對稱

![](https://901207480-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LGKoChvN9am4__HCIRK%2F-LOSWpDeKKzRSEn0doCN%2F-LOSXHJR-RQAxeLZSNpp%2F%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-10-10%20%E4%B8%8B%E5%8D%886.32.21.png?alt=media\&token=1cc44919-e02c-4726-9eaa-101deca0760a)

## 2.想法 <a href="#id-2-xiang-fa" id="id-2-xiang-fa"></a>

* 提問
  * 確認題意:  root是NULL是true或false?
* function header, parameter
* test input
* 說明想法
  * 將root複製出一份左右對稱的樹後, 比較root 與該數是否是same tree
* 測試計算複雜度
  * recursive的runtime是計算total call number
    * deepCopy
    * swap
    * isSameTree

## **3.程式碼** <a href="#id-3-cheng-shi" id="id-3-cheng-shi"></a>

```
/**
 * 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 isSymmetric(TreeNode* root) {
        if (!root) { 
            return true;
        }
        
        TreeNode* copy = deepCopy(root);
        TreeNode* swapNode = swap(copy);
        return isSameTree(root, swapNode);
    }
private:
    TreeNode* deepCopy(TreeNode* node){
        if (!node) {
            return NULL;
        }
        TreeNode* newNode = new TreeNode(node->val);
        newNode->left = deepCopy(node->left);
        newNode->right = deepCopy(node->right);
        return newNode;
    }
    
    TreeNode* swap(TreeNode* node){
        if (!node) {
            return NULL;
        }
        
        node->left = swap(node->left);
        node->right = swap(node->right);
        TreeNode* tmp = node->left;
        node->left = node->right;
        node->right = tmp;
        return node;
    }
    
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if (!p && !q) {
            return true;
        } 
        
        if (!p || !q) {
            return false;
        } 
        
        if (p->val == q->val) {
            return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
        }
        
        return false;
    }
};
```