# Introduction In this challenge, we will work with binary trees. Our objective is to create a function, known as `isSameTree`, that accepts the roots of two binary trees, namely `p` and `q`, and establishes if they are identical. For binary trees to be the same, they must have identical structures and node values. We will receive sample inputs and expected output data to confirm the accuracy of our function.
Click the virtual machine below to start practicing