Algo. Leetcode. 100. Same Tree

source

Given the roots of two binary trees p and q, 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: p = [1,2,3], q = [1,2,3]
Output: true

Example 2:

Input: p = [1,2], q = [1,null,2]
Output: false

Example 3:

Input: p = [1,2,1], q = [1,1,2]
Output: false

Constraints:

  • The number of nodes in both trees is in the range [0, 100].
  • -104 <= Node.val <= 104

Decision

/**
 * 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;       
           
     }        
        
       var left = IsSameTree(p.left, q.left);
       var right = IsSameTree(p.right, q.right);        
        
       return left && right;                             
        
    }    
    
}
This entry was posted in Без рубрики. Bookmark the permalink.