Blogs Hub

by Sumit Chourasia | Oct 06, 2020 | Category :coding | Tags : algorithm binary-tree data-structure easy leetcode tree

Same Tree - Tree - Easy - LeetCode

Same Tree - Tree - Easy - LeetCode

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.

Example 1:

Input:     1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]

Output: true
Example 2:

Input:     1         1
          /           \
         2             2

        [1,2],     [1,null,2]

Output: false
Example 3:

Input:     1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]

Output: false

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
public class Solution {
    public bool IsSameTree(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 IsSameTree(p.left,q.left) && IsSameTree(p.right,q.right);
    }
}

Time Complexity: O(n)

Space Complexity: O(1)

Contributed By: Sumit Chourasia
Duplicate Emails - Sql - Easy - LeetCode
Contributed By: Sumit Chourasia
Valid Phone Numbers - Bash - Easy - LeetCode
Contributed By: Sumit Chourasia
3Sum - Array - Medium - LeetCode
Contributed By: Sumit Chourasia
Merge Intervals - Array - Medium - LeetCode