872. Leaf-Similar Trees
题目
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.
Note:
- Both of the given trees will have between
1
and100
nodes.
解决
采用深度优先遍历二叉树,记录叶节点的值(将叶节点的值添加到string
中,变成一个字符串)。之后比较两个二叉树的叶节点的值和顺序是否相同,这里利用字符串来比较是否相同。
这里不能采用广度优先遍历二叉树,如果采用了广度优先遍历二叉树,这样上面二叉树的叶节点的顺序就会变成(6, 9, 8, 7, 4)
,这样与题目给的不一样。
假设二叉树有n
个节点。
- 时间复杂度:O(n)
- 空间复杂度:O(n)
/**
* 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 leafSimilar(TreeNode* root1, TreeNode* root2) {
string a = leafString(root1);
string b = leafString(root2);
return (a == b);
}
// 记录二叉树叶节点的值和顺序
string leafString(TreeNode* root) {
string leaf = "";
if (root == NULL) {
return leaf;
}
stack<TreeNode* > tree;
tree.push(root);
while (!tree.empty()) {
TreeNode* temp = tree.top();
tree.pop();
if (!temp->left && !temp->right) leaf += to_string(temp->val) + "%";
if (temp->left) tree.push(temp->left);
if (temp->right) tree.push(temp->right);
}
return leaf;
}
};