Leetcode算法题总结6-树

1.递归

一棵树要么是空树，要么有两个指针，每个指针指向一棵树。树是一种递归结构，很多树的问题可以使用递归来处理。

1.1 树的高度

104. Maximum Depth of Binary Tree (Easy)

Leetcode / 力扣

public int maxDepth(TreeNode root) {
    if (root == null) return 0;
    return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
}

1.2 平衡树

110. Balanced Binary Tree (Easy)

Leetcode / 力扣

  3

  / \

9 20

  / \

  15   7

平衡树左右子树高度差都小于等于 1

private boolean result = true;
 
public boolean isBalanced(TreeNode root) {
    maxDepth(root);
    return result;
}
 
public int maxDepth(TreeNode root) {
    if (root == null) return 0;
    int l = maxDepth(root.left);
    int r = maxDepth(root.right);
    if (Math.abs(l - r) > 1) result = false;
    return 1 + Math.max(l, r);
}

1.3 两节点的最长路径

543. Diameter of Binary Tree (Easy)

Leetcode / 力扣

Input:

        1

      / \

      2 3

    / \

    4   5

Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

private int max = 0;
 
public int diameterOfBinaryTree(TreeNode root) {
    depth(root);
    return max;
}
 
private int depth(TreeNode root) {
    if (root == null) return 0;
    int leftDepth = depth(root.left);
    int rightDepth = depth(root.right);
    max = Math.max(max, leftDepth + rightDepth);
    return Math.max(leftDepth, rightDepth) + 1;
}

1.4 翻转树

226. Invert Binary Tree (Easy)

Leetcode / 力扣

public TreeNode invertTree(TreeNode root) {
    if (root == null) return null;
    TreeNode left = root.left;  // 后面的操作会改变 left 指针，因此先保存下来
    root.left = invertTree(root.right);
    root.right = invertTree(left);
    return root;
}

1.5 归并两棵树

617. Merge Two Binary Trees (Easy)

Leetcode / 力扣

Input:

      Tree 1                     Tree 2

        1                         2

        / \                       / \

      3   2                     1   3

      /                           \   \

    5                             4   7

Output:

        3

      / \

      4   5

    / \   \

    5   4   7

public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
    if (t1 == null && t2 == null) return null;
    if (t1 == null) return t2;
    if (t2 == null) return t1;
    TreeNode root = new TreeNode(t1.val + t2.val);
    root.left = mergeTrees(t1.left, t2.left);
    root.right = mergeTrees(t1.right, t2.right);
    return root;
}