LeetCode Symmetric Tree BFS (golang & java)

最新推荐文章于 2021-11-17 13:45:40 发布

Jasonzz_

最新推荐文章于 2021-11-17 13:45:40 发布

阅读量148

点赞数 1

分类专栏： LeetCode每日一题文章标签： bfs golang java recursion iteration

本文链接：https://blog.csdn.net/qq_46595591/article/details/107952267

版权

LeetCode每日一题专栏收录该内容

43 篇文章 0 订阅

订阅专栏

本文介绍了如何使用广度优先搜索（BFS）解决LeetCode上的对称二叉树问题。通过同步移动两个指针p和q，分别从树的根节点开始，p向右移动，q向左移动，然后p左移，q右移，检查当前p和q节点的值是否相等，并递归判断左右子树的对称性。提供了Golang和Java的代码实现。

摘要由CSDN通过智能技术生成

Problem
在这里插入图片描述
Analysis Process
Both trees are mirror images of each other if the following conditions are met
Both of their roots have the same value
The right subtree of each tree is mirrored to the left subtree of the other tree

We can achieve such a recursive function, by using the method of synchronous mobile two Pointers to traverse the tree, p pointer and q pointer points to the root of the tree at the beginning, then p moves to the right, q left, p left shift, q moves to the right to inspect the current p and q node values are equal, if equal to judge whether the left and right subtrees symmetry

Code
golang

Recursion
func isSymmetric(root *TreeNode) bool {
    return check(root, root)
}

func check(p, q *TreeNode) bool {
    if p == nil && q == nil {
        return true
    }
    if p == nil || q == nil {
        return false
    }
    return p.Val == q.Val && check(p.Left, q.Right) && check(p.Right, q.Left) 
}

Iteration
func isSymmetric(root *TreeNode) bool {
    u, v := root, root
    q := []*TreeNode{}
    q = append(q, u)
    q = append(q, v)
    for len(q) > 0 {
        u, v = q[0], q[1]
        q = q[2:]
        if u == nil && v == nil {
            continue
        }
        if u == nil || v == nil {
            return false
        }
        if u.Val != v.Val {
            return false
        }
        q = append(q, u.Left)
        q = append(q, v.Right)

        q = append(q, u.Right)
        q = append(q, v.Left)
    }
    return true
}

java

Recursion
class Solution {
    public boolean isSymmetric(TreeNode root) {
        return check(root, root);
    }

    public boolean check(TreeNode p, TreeNode q) {
        if (p == null && q == null) {
            return true;
        }
        if (p == null || q == null) {
            return false;
        }
        return p.val == q.val && check(p.left, q.right) && check(p.right, q.left);
    }
}

Iteration
class Solution {
    public boolean isSymmetric(TreeNode root) {
        return check(root, root);
    }

    public boolean check(TreeNode u, TreeNode v) {
        Queue<TreeNode> q = new LinkedList<TreeNode>();
        q.offer(u);
        q.offer(v);
        while (!q.isEmpty()) {
            u = q.poll();
            v = q.poll();
            if (u == null && v == null) {
                continue;
            }
            if ((u == null || v == null) || (u.val != v.val)) {
                return false;
            }

            q.offer(u.left);
            q.offer(v.right);

            q.offer(u.right);
            q.offer(v.left);
        }
        return true;
    }
}