zoukankan      html  css  js  c++  java
  • [LeetCode] Symmetric Tree

    Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

    For example, this binary tree is symmetric:

        1
       / 
      2   2
     /  / 
    3  4 4  3
    

    But the following is not:

        1
       / 
      2   2
          
       3    3
    

    Note:
    Bonus points if you could solve it both recursively and iteratively.

    解题思路:

    递归做很直接。

    /**
     * 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 test(TreeNode *a, TreeNode *b)
        {
            if(a == NULL && b == NULL) return true;
            if(a == NULL || b == NULL) return false;
            if(a -> val != b -> val) return false;
            if(test(a -> left, b -> right) && test(a -> right, b -> left)) return true;
            else return false;
        }
        
        bool isSymmetric(TreeNode *root) {
            // IMPORTANT: Please reset any member data you declared, as
            // the same Solution instance will be reused for each test case.
            if(root == NULL) return true;
            return test(root -> left, root -> right);
        }
    };
  • 相关阅读:
    洛谷P1762 偶数
    复习1
    zoj3329 One Person Game
    poj2096 Collecting Bugs
    hdu4035 Maze
    Cogs 2856. [洛谷U14475]部落冲突
    洛谷P2474 [SCOI2008]天平
    洛谷P3802 小魔女帕琪
    清北刷题冲刺 11-03 p.m
    清北刷题冲刺 11-03 a.m
  • 原文地址:https://www.cnblogs.com/changchengxiao/p/3416701.html
Copyright © 2011-2022 走看看