如何在Java中找到树中最长的单词(没有循环(for，while，do ...))

import java.util.ArrayList;
import java.util.List;

class TreeNode {
    String word;
    List<TreeNode> children;

    public TreeNode(String word) {
        this.word = word;
        this.children = new ArrayList<>();
    }
}

public class LongestWordInTree {
    public static String findLongestWord(TreeNode root) {
        if (root == null) {
            return "";
        }

        String longestWord = "";
        for (TreeNode child : root.children) {
            String childLongestWord = findLongestWord(child);
            if (childLongestWord.length() > longestWord.length()) {
                longestWord = childLongestWord;
            }
        }

        if (root.word.length() > longestWord.length()) {
            longestWord = root.word;
        }

        return longestWord;
    }

    public static void main(String[] args) {
        // 构建一个示例树
        TreeNode root = new TreeNode("");
        TreeNode node1 = new TreeNode("hello");
        TreeNode node2 = new TreeNode("world");
        TreeNode node3 = new TreeNode("java");
        TreeNode node4 = new TreeNode("programming");
        TreeNode node5 = new TreeNode("language");

        root.children.add(node1);
        root.children.add(node2);
        node2.children.add(node3);
        node3.children.add(node4);
        node4.children.add(node5);

        String longestWord = findLongestWord(root);
        System.out.println("最长的单词是：" + longestWord);
    }
}