[leetcode] 100 Same Tree
Posted 白天黑夜每日c
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[leetcode] 100 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 true; if(p && q) { if((p->val == q->val) && isSameTree(p->left,q->left) && isSameTree(p->right,q->right)) return true; } return false; } };
以上是关于[leetcode] 100 Same Tree的主要内容,如果未能解决你的问题,请参考以下文章