124. Same Tree

PRO

Easy

Topics

Companies

Hint

Understand Before Coding

Step 1 / 26

Speed: 1.0x

Recursive Comparison

Two identical binary trees

Tree P

Tree Q

Process Step

Comparing node p(1) and q(1)

Variables

p.val1

q.val1

checkingnodes

step1 / 26

Loading visualization...

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: p = [1,2,3], q = [1,2,3]

Output: true

Explanation: Both trees have the same structure and values.

Example 2:

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

Output: false

Explanation: The trees have different structures. 'p' has node 2 as the left child of 1, while 'q' has it as the right child of 1.

Example 3:

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

Output: false

Explanation: The trees have the same structure, but the node values are different. The left and right subtrees of the root have different values.

Constraints:

•
•

Time Complexity

O(n)

Space Complexity

O(h)

124. Same Tree

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

124. Same Tree

Understand Before Coding

Recursive Comparison

Tree P

Tree Q

Variables

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

Recursive Comparison

Tree P

Tree Q

Variables