struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x),
left(left),
right(right) {}
};
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
// write you code here
}
};
// add main method and test cases to test your code
Given the roots of two binary trees p and q, write a function to
check if they are the
same or not.
Two binary trees are considered the same if they are structurally
identical, and the
nodes have the same value.
Example 1:
Input: p = [1,2,3], q = [1,2,3]
Output: true
Example 2:
Input: p = [1,2], q = [1,null,2]
Output: false
Example 3:
Input: p = [1,2,1], q = [1,1,2]
Output: false
- Given The Following Code Struct Treenode Int Val Treenode Left Treenode Right Treenode Val 0 Left Nullptr 1 (53.18 KiB) Viewed 59 times