Java 8 Stream中的递归是如何工作的？

import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;

public class RecursiveStreamExample {

    public static void main(String[] args) {
        // 构建示例数据
        Node root = new Node(1);
        root.getChildren().add(new Node(2));
        root.getChildren().add(new Node(3));
        root.getChildren().add(new Node(4));

        root.getChildren().get(0).getChildren().add(new Node(5));
        root.getChildren().get(0).getChildren().add(new Node(6));
        root.getChildren().get(1).getChildren().add(new Node(7));

        // 使用Stream和递归遍历树形数据结构
        List<Integer> result = traverse(root).stream().collect(Collectors.toList());
        System.out.println(result); // 输出: [1, 2, 5, 6, 3, 4, 7]
    }

    private static List<Node> traverse(Node node) {
        List<Node> result = new ArrayList<>();
        result.add(node);
        node.getChildren().stream().forEach(child -> result.addAll(traverse(child)));
        return result;
    }

    public static class Node {
        private int value;
        private List<Node> children;

        public Node(int value) {
            this.value = value;
            this.children = new ArrayList<>();
        }

        public int getValue() {
            return value;
        }

        public List<Node> getChildren() {
            return children;
        }
    }
}