LeetCode 100. Same Tree

来源:互联网 发布:淘宝客服常用语大全 编辑:程序博客网 时间:2024/06/04 19:12

Description

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.

Code

/** * 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) {        return s(p,q);    }private:    bool s(TreeNode* p, TreeNode* q){        if (!p && !q) return true;        if (!p || !q) return false;        return (p->val == q->val) && s(p->left, q->left) && s(p->right, q->right);    }};

Appendix

  • Link: https://leetcode.com/problems/same-tree/
  • Run Time: 3ms
0 0
原创粉丝点击