Package g0001_0100.s0100_same_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    100 - Same Tree.

    Easy

    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].

    • <code>-10<sup>4</sup><= Node.val <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean isSameTree(TreeNode p, TreeNode q)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait