leetcode #100 Same Tree

基本的DFS周遊

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

Fight On！