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.
Asked at 8 companies
AmazonAppleBloomberg
Hints
1.Think about what data structure fits Same Tree
2.Consider the brute force complexity and how to optimize