1.二叉树里的双指针
1.1判断两棵树是否相同
public static boolean isSameTree(TreeNode p, TreeNode q) {
//如果都为空我们就认为他是相同的
if (p == null && q == null) {
return true;
}
//如果一个为空,一个不为空,很明显不可能是相同的树,直接返回false即可
if (p == null || q == null) {
return false;
}
//如果这两个节点都不为空并且又不相等,所以他也不可能是相同的树,直接返回false
if (p.val != q.val) {
return false;
}
//走到这一步说明节点p和q是完全相同的,我们只需要在比较他们的左右子节点即可
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}
1.2对称二叉树
public static boolean isSymmetric(TreeNode root) {
if (root == null) {
return true;
}
return check(root.left, root.right);
}
public static boolean check(TreeNode p, TreeNode q) {
if (p == null && q == null) {
return true;
}
if (p == null || q == null) {
return false;
}
if (p.val != q.val) {
return false;
}
return check(p.left, q.right) && check(p.right, q.left);
}
1.3合并二叉树
public static TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
if (t1 == null) {
return t2;
}
if (t2 == null) {
return t1;
}
TreeNode merged = new TreeNode(t1.val + t2.val);
merged.left = mergeTrees(t1.left, t2.left);
merged.right = mergeTrees(t1.right, t2.right);
return merged;
}
2.路径专题
2.1二叉树的所有路径
public static List<String> binaryTreePaths(TreeNode root) {
List<String> res = new ArrayList<>();
dfs(root, "", res);
return res;
}
private static void dfs(TreeNode root, String path, List<String> res) {
//如果为空,直接返回
if (root == null) {
return;
}
//如果是叶子节点,说明找到了一条路径,把它加入到res中
if (root.left == null && root.right == null) {
res.add(path + root.val);
return;
}
//如果不是叶子节点,在分别遍历他的左右子节点
dfs(root.left, path + root.val + "->", res);
dfs(root.right, path + root.val + "->", res);
}
2.2路径总和
public static boolean hasPathSum(TreeNode root, int sum) {
if (root == null) {
return false;
}
if (root.left == null && root.right == null) {
return sum == root.val;
}
return hasPathSum(root.left, sum - root.val) || hasPathSum(root.right, sum - root.val);
}
3.翻转的妙用
3.1递归
前序
public static TreeNode invertTree_1(TreeNode root) {
if (root == null) {
return null;
}
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
TreeNode left = invertTree_1(root.left);
TreeNode right = invertTree_1(root.right);
return root;
}
后序
public static TreeNode invertTree_2(TreeNode root) {
if (root == null) {
return null;
}
TreeNode left = invertTree_2(root.left);
TreeNode right = invertTree_2(root.right);
root.left = right;
root.right = left;
return root;
}
3.2层次遍历
public static int findBottomLeftValue(TreeNode root) {
if (root.left == null && root.right == null) {
return root.val;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
TreeNode temp = new TreeNode(-100);
while (!queue.isEmpty()) {
temp = queue.poll();
if (temp.right != null) {
// 先把右节点加入 queue
queue.offer(temp.right);
}
if (temp.left != null) {
// 再把左节点加入 queue
queue.offer(temp.left);
}
}
return temp.val;
}