zoukankan      html  css  js  c++  java
  • 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.

    Subscribe to see which companies asked this question

    Show Tags
     

    /**
    * 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 true;
    } else if (p != NULL && q != NULL && p->val == q->val) {
    return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
    } else {
    return false;
    }
    }
    };

  • 相关阅读:
    Linux
    Cookie & Session
    HTTP
    HTTP
    抓包工具
    抓包工具
    抓包工具
    python
    python
    python
  • 原文地址:https://www.cnblogs.com/SpeakSoftlyLove/p/5210148.html
Copyright © 2011-2022 走看看