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 == NULL && q != NULL) return false;if (p != NULL && q == NULL) return false;if (p->val == q->val) {bool x = isSameTree(p->left, q->left);bool y = isSameTree(p->right, q->right);return x&&y;}return false;} };

?

轉載于:https://www.cnblogs.com/pk28/p/7218111.html

總結

以上是生活随笔為你收集整理的100. Same Tree的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。