Same Tree
Desicription
Given two binary trees, 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.
Example 1:
1 2 3 4 5 6 7
 Input: 1 1 / \ / \ 2 3 2 3
[1,2,3], [1,2,3]
Output: true

Example 2:
1 2 3 4 5 6 7
 Input: 1 1 / \ 2 2
[1,2], [1,null,2]
Output: false

Example 3:
1 2 3 4 5 6 7
 Input: 1 1 / \ / \ 2 1 1 2
[1,2,1], [1,1,2]
Output: false

Solution
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

class Solution { public: bool isSameTree(TreeNode* p, TreeNode* q) { if(p == NULL && q == NULL) return 1; if(p == NULL  q == NULL) return 0; if(p>val == q>val) return isSameTree(p>left, q>left) && isSameTree(p>right, q>right); return 0; } };
