Consider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf value sequence.
For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8).
Two binary trees are considered leaf-similar if their leaf value sequence is the same.
Return true if and only if the two given trees with head nodes root1 and root2 are leaf-similar.
Example 1:
Input: root1 = [3,5,1,6,2,9,8,null,null,7,4], root2 = [3,5,1,6,7,4,2,null,null,null,null,null,null,9,8] Output: true
Example 2:
Input: root1 = [1,2,3], root2 = [1,3,2] Output: false
Constraints:
[1, 200].[0, 200].
class Solution {
public:
void checkLeaf(TreeNode* root, vector<int>& data)
{
if(root->left==NULL and root->right==NULL)
{
data.push_back(root->val);
return;
}
if(root->left)checkLeaf(root->left,data);
if(root->right)checkLeaf(root->right,data);
}
bool leafSimilar(TreeNode* root1, TreeNode* root2) {
vector<int> data1;
vector<int> data2;
checkLeaf(root1,data1);
checkLeaf(root2,data2);
if(data1.size()!=data2.size())return false;
int i=0;
while(i<data1.size())
{
if(data1[i]!=data2[i])return false;
i++;
}
return true;
}
};
Office:- 660, Sector 14A, Vasundhara, Ghaziabad, Uttar Pradesh - 201012, India
