Given the roots of two binary trees p and q, return true if the trees are equivalent, otherwise return false.
Two binary trees are considered equivalent if they share the exact same structure and the nodes have the same values.
Example 1:
Input: p = [1,2,3], q = [1,2,3]
Output: true
Example 2:
Input: p = [4,7], q = [4,null,7]
Output: false
Example 3:
Input: p = [1,2,3], q = [1,3,2]
Output: false
Constraints:
0 <= The number of nodes in both trees <= 100.-100 <= Node.val <= 100
Examples
Example 1:
Input: p = [1,2,3], q = [1,2,3]
Output: true
Example 2:
Input: p = [4,7], q = [4,null,7]
Output: false
Example 3:
Input: p = [1,2,3], q = [1,3,2]
Output: false
Constraints
- `0 <= The number of nodes in both trees <= 100`.
- `-100 <= Node.val <= 100`
Prerequisites
- Binary Tree(Data Structures & Algorithms for Beginners)
- Depth-First Search(Data Structures & Algorithms for Beginners)
- Breadth-First Search(Data Structures & Algorithms for Beginners)
Target: O(N) time • O(1) spaceTree / Depth-First Search / Breadth-First Search / Binary Tree
Socratic AI Tutor
Gemini 3.8 Flash
Loading editor...
Click "Run" or press Ctrl+Enter to execute test cases.