使用LINQ展平获得最深值的树

using System;
using System.Collections.Generic;
using System.Linq;

public class TreeNode
{
    public int Value { get; set; }
    public List<TreeNode> Children { get; set; } = new List<TreeNode>();
}

public class TreeExample
{
    public static void Main()
    {
        var root = new TreeNode { Value = 1 };
        var child1 = new TreeNode { Value = 2 };
        var child2 = new TreeNode { Value = 3 };
        var grandChild = new TreeNode { Value = 4 };

        root.Children.Add(child1);
        root.Children.Add(child2);
        child1.Children.Add(grandChild);

        // 使用LINQ展平树并找到最深层的节点值
        var deepestValue = FindDeepestValue(root);
        Console.WriteLine($"The deepest value is: {deepestValue}");
    }

    private static int FindDeepestValue(TreeNode root)
    {
        var nodes = new Queue<TreeNode>();
        nodes.Enqueue(root);

        TreeNode deepestNode = null;

        while (nodes.Any())
        {
            var currentNode = nodes.Dequeue();
            deepestNode = currentNode;

            foreach (var child in currentNode.Children)
            {
                nodes.Enqueue(child);
            }
        }

        return deepestNode.Value;
    }
}