Leetcode - same-tree

https://leetcode.com/problems/same-tree/

Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

There are many ways to check whether they're the same tree.

Method1: recursive

func isSameTree(t1 *TreeNode, t2 *TreeNode) bool {
    if (t1 == nil && t2 != nil) || (t1 != nil && t2 == nil) {
        return false
    }
    if t1 == nil && t2 == nil {
        return true
    }
    if t1.Val != t2.Val {
        return false
    }
   
    return isSameTree(t1.Left, t2.Left) && isSameTree(t1.Right, t2.Right)
}

def is_same_tree p, q
    if (p == nil && q != nil) || (p != nil && q == nil)
        return false
    end
    if p == nil && q == nil
        return true
    end
    if p.val != q.val
        return false
    end
    
    return is_same_tree(p.left, q.left) && is_same_tree(p.right, q.right)
end

Method2: in-order and pre-order to traversal two trees and see whether the orders are all the same

• 相关文章
• 全局相关文章