zoukankan      html  css  js  c++  java
  • [LeetCode100]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 a binary tree node.
     * 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) {
            if(p == NULL || q == NULL)
                return p == q;
            return p->val == q->val && isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
        }
    };
  • 相关阅读:
    win中使用curl上传文件报错
    S2-052
    S2-048
    S2-045、S2-046
    S2-033、S2-037
    S2-032
    S2-029
    day12-python之深灰魔法
    day10-11-python基础之字符串
    day09-python基础
  • 原文地址:https://www.cnblogs.com/zhangbaochong/p/5154238.html
Copyright © 2011-2022 走看看