package com.algorithm04;

import com.tools.TreeBinaryFunction;
import com.tools.TreeNode;

public class Algorithm28 {
    
    public static boolean Solution(TreeNode root){
        if(root==null){
            return true;
        }
        return Solution(root.left,root.right);
    }
    public static boolean Solution(TreeNode leftNode , TreeNode rightNode){
        if(leftNode == null && rightNode == null){
            return true;
        }
        if(leftNode == null || rightNode == null){
            return false;
        }
        if(leftNode.val == rightNode.val)    
            return Solution(leftNode.left, rightNode.right)&&Solution(leftNode.right, rightNode.left);
        return false;
    }
    
    public static void main(String[] args) {
        TreeNode treeNode = new TreeNode(0);
        TreeBinaryFunction.CreateTreeBinary(treeNode);
        boolean isflag = Solution(treeNode);
        System.err.println(isflag);
    }
}