LeetCode.872: Leaf-Similar Trees

最新推荐文章于 2025-09-30 07:15:00 发布

一天一道力扣

最新推荐文章于 2025-09-30 07:15:00 发布

阅读量144

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode刷题之路文章标签： LeetCode

本文链接：https://blog.csdn.net/lcpskk/article/details/82695264

Leetcode刷题之路专栏收录该内容

6 篇文章

订阅专栏

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.

answer:

public class Solution {
    public void TraverseNode(StringBuilder leafStr,TreeNode node)
        {
            if (node == null)
            {
                return;
            }
            if (node.left == null && node.right == null)
            {
                if (leafStr == null)
                {
                    leafStr = new StringBuilder();
                }
                leafStr.Append(node.val+"-");
            }
            if (node.left != null)
            {
                TraverseNode(leafStr, node.left);
            }
            if (node.right != null)
            {
                TraverseNode(leafStr, node.right);
            }
        }
        public bool LeafSimilar(TreeNode root1, TreeNode root2)
        {
            StringBuilder strLeaf1 = new StringBuilder();
            StringBuilder strLeaf2 = new StringBuilder();

            TraverseNode(strLeaf1, root1);
            TraverseNode(strLeaf2, root2);

            return strLeaf1.Equals(strLeaf2);
        }
}