Given two binary trees, write a method to check if the trees are the same or not

How to check if two binary trees are the same

Given two binary <code>trees</code>, write a method to check if the trees are the <code>same</code> or not.
 
<code>Example 1</code>
<pre><code>Input: 1 1
 / \ / \
 5 3 5 3

Output: true
</code></pre>
<code>Example 2</code>
<pre><code>Input: 1 1
 / \ / \
 2 3 5 3

Output: false
</code></pre>
<blockquote>
Explanation: <code>Left nodes</code> have different values
</blockquote>

9: Same tree