代码随想录算法训练营第15天|226.翻转二叉树， 101.对称二叉树

最新推荐文章于 2024-08-25 22:03:20 发布

sanshui013

最新推荐文章于 2024-08-25 22:03:20 发布

阅读量234

点赞数 1

文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/sanshui013/article/details/135952121

版权

226.翻转二叉树

力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root==null){
            return null;
        }

        invertTree(root.left);
        invertTree(root.right);
        swapChildren(root);
        return root;
    }

     private void swapChildren(TreeNode root) {
        TreeNode tmp = root.left;
        root.left = root.right;
        root.right = tmp;
    }

}

101.对称二叉树

力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
       return compare(root.left,root.right);
    }

     private boolean compare(TreeNode left, TreeNode right) {
         if(left==null&&right!=null){
             return false;
         }
         if(left!=null && right == null){
             return false;
         }
         if(left ==null && left == null){
             return true;
         }
          if (left.val != right.val) {
            return false;
        }
         // 比较外侧
        boolean compareOutside = compare(left.left, right.right);
        // 比较内侧
        boolean compareInside = compare(left.right, right.left);
        return compareOutside && compareInside;

     }
}