题解 | #牛群的相似结构#

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param p TreeNode类 
     * @param q TreeNode类 
     * @return bool布尔型
     */
    public boolean isSameTree (TreeNode p, TreeNode q) {
        // write code here
        StringBuilder sb1 = new StringBuilder();
        StringBuilder sb2 = new StringBuilder();
        preOrder(p,sb1);
        preOrder(q,sb2);
        inOrder(p,sb1);
        inOrder(q,sb2);
        return sb1.toString().equals(sb2.toString());
    }

    public void preOrder(TreeNode root,StringBuilder sb){
        if(root == null){
            return;
        }

        sb.append(root.val);
        preOrder(root.left,sb);
        preOrder(root.right,sb);
    }

    public void inOrder(TreeNode root,StringBuilder sb){
        if(root == null){
            return;
        }
       
        inOrder(root.left,sb);
        sb.append(root.val);
        inOrder(root.right,sb);
    }
}