dsa · easy

Same Tree

Return whether two binary trees p and q have the same shape and the same values. Each node is [value, left, right] or None.

Arguments

• p — first tree as nested [value, left, right] or None
• q — second tree in the same encoding

Example

p = [1,[2,None,None],[3,None,None]], q = [1,[2,None,None],[3,None,None]] → true.

p = [1,[2,None,None],None], q = [1,None,[2,None,None]] → false (2 is left vs right).

Constraints

Each node is [value, left, right] or None

Examples

Example 1

Input:
[1,[2,None,None],[3,None,None]]
[1,[2,None,None],[3,None,None]]

Expected:
true

Example 2

Input:
[1,[2,None,None],None]
[1,None,[2,None,None]]

Expected:
false

Open in the Dojo editor