LeetCode-543. 二叉树的直径、226. 翻转二叉树

目录

543. 二叉树的直径

226. 翻转二叉树

---

 

543. 二叉树的直径

题目：

代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private int max=0;
    public int diameterOfBinaryTree(TreeNode root) {
        depth(root);
        return max;
    }  
    
    //树的高度
    private int depth(TreeNode root){
        if(root==null){
            return 0;
        }
        
        int l=depth(root.left);
        int r=depth(root.right);
        max=Math.max(max,l+r);
        return Math.max(l,r)+1;
    }
}

---

226. 翻转二叉树

题目：

代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root==null){
            return null;
        }
        TreeNode l=invertTree(root.left);
        TreeNode r=invertTree(root.right);
        root.left=r;
        root.right=l;
        return root;
    }
}