Tree

59. Same Tree

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.

Examples

Example 1

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

Dadas las raices de dos arboles binarios p y q, escribe una funcion para verificar si son iguales o no.

Dos arboles binarios se consideran iguales si son estructuralmente identicos y los nodos tienen el mismo valor.

Ejemplos

Ejemplo 1

Entrada: p = [1,2,3], q = [1,2,3]
Salida: true
solution.py
Keyboard shortcuts
h Previous problem
l Next problem
Esc Back to index
? Toggle this help