[Algorithm] Compare two Binary tree are the same in both value and shape
export default function compare(
a: BinaryNode<number> | null,
b: BinaryNode<number> | null,
): boolean {
if (a === null && b === null) {
return true;
}
if (a === null || b === null) {
return false;
}
if (a.value !== b.value) {
return false;
}
return compare(a.left, b.left) && compare(a.right, b.right);
}