100. Same Tree

直接的思路是求中序遍历的序列，进行比较。另外的思路是一边遍历，一边比较。有递归式和非递归式，形式和98题的博客上介绍的一致。

递归代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null && q == null){return true;}
        if (p == null && q != null){return false;}
        if (p != null && q == null){return false;}
        
        return p.val == q.val && isSameTree(p.left,q.left) && isSameTree(p.right,q.right);
        
    }
    
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p == null && q == null) return true;
        if(p == null || q == null) return false;
        if(p.val != q.val) return false;
        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }
    
}

非递归式代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p == null && q == null) return true;
        if(p == null || q == null) return false;
        Stack<TreeNode> stackP = new Stack<>(), stackQ = new Stack<>();
        TreeNode currP = p, currQ = q;
        while((currP != null && currQ != null) || (!stackP.isEmpty() && !stackQ.isEmpty())){
            while(currP != null || currQ != null){// traverse root
                if(currP == null || currQ == null || currP.val != currQ.val) return false;    //check whether p and q is null;
                stackP.push(currP);
                currP = currP.left;
                stackQ.push(currQ);
                currQ = currQ.left;      
            }        
            currP = stackP.pop();    // when exit the while loop, both p and q equals null, so return to its parent node
            currQ = stackQ.pop();    
            currP = currP.right;    //point to the right node, traverse sub tree
            currQ = currQ.right;
        }
        return true;
    }
}