-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
60 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
# Descripción | ||
|
||
El abuelo 👴 dice que ve todos los árboles de navidad iguales... La abuela 👵, en cambio, piensa que no. Que todos los árboles de navidad son distintos... | ||
|
||
Vamos a hacer una función que nos diga si dos árboles de navidad son iguales. Para ello, vamos a comparar [los árboles que ya creamos en el reto 22](../challenge-22/README.md). | ||
|
||
Tenemos que ver si ambos árboles tienen la misma estructura y los mismos valores en todas las ramas. Aquí tienes unos ejemplos: | ||
|
||
```js | ||
const tree = { | ||
value: 1, | ||
left: { value: 2, left: null, right: null }, | ||
right: { value: 3, left: null, right: null }, | ||
}; | ||
|
||
checkIsSameTree(tree, tree); // true | ||
|
||
const tree2 = { | ||
value: 1, | ||
left: { value: 3, left: { value: 2, left: null, right: null }, right: null }, | ||
right: { value: 5, left: null, right: { value: 4, left: null, right: null } }, | ||
}; | ||
|
||
checkIsSameTree(tree, tree2); // false | ||
checkIsSameTree(tree2, tree2); // true | ||
``` | ||
|
||
El cuñado 🦹♂️, que se las sabe todas, me ha dicho que tenga cuidado porque el truco del JSON.stringify puede no funcionar... ya que los árboles pueden ser el mismo pero el orden de representación de las ramas izquierda y derecha puede ser inversa... |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,32 @@ | ||
export default function checkIsSameTree(treeA, treeB) { | ||
if (treeA === treeB) { | ||
return true; | ||
} | ||
|
||
const stack = [{ nodeA: treeA, nodeB: treeB }]; | ||
|
||
while (stack.length) { | ||
const { nodeA, nodeB } = stack.pop(); | ||
|
||
if (nodeA.value !== nodeB.value) { | ||
return false; | ||
} | ||
|
||
if (nodeA.left && nodeB.left) { | ||
stack.push({ nodeA: nodeA.left, nodeB: nodeB.left }); | ||
} else if (!nodeA.left && !nodeB.left) { | ||
// do nothing | ||
} else { | ||
return false; | ||
} | ||
|
||
if (nodeA.right && nodeB.right) { | ||
stack.push({ nodeA: nodeA.right, nodeB: nodeB.right }); | ||
} else if (!nodeA.right && !nodeB.right) { | ||
// do nothing | ||
} else { | ||
return false; | ||
} | ||
} | ||
return true; | ||
} |