zoukankan      html  css  js  c++  java
  • LeetCode-Same Tree

    Given two binary trees, write a function to check if they are equal or not.

    Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

    /**
     * Definition for binary tree
     * struct TreeNode {
     *     int val;
     *     TreeNode *left;
     *     TreeNode *right;
     *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
     * };
     */
    class Solution {
    public:
        bool isSameTree(TreeNode *p, TreeNode *q) {
            // Start typing your C/C++ solution below
            // DO NOT write int main() function
            if(p==NULL&&q==NULL)return true;
            else if(p!=NULL&&q!=NULL){
                if(p->val!=q->val)return false;
                if(isSameTree(p->left,q->left)&&isSameTree(p->right,q->right))
                return true;
                else return false;
            }
            else return false;
        }
    };
    
  • 相关阅读:
    Daily Scrum 10.31
    Daily Scrum 10.30
    Daily Scrum 10.29
    Daily Scrum 10.28
    扩展设置
    安装
    james+javamail入门
    解决ZF2_PATH environment
    Apache Httpd Server 2.2升级2.4
    缓存,spring
  • 原文地址:https://www.cnblogs.com/superzrx/p/3324763.html
Copyright © 2011-2022 走看看