Javaで任意の子ノードを持つツリーデータ構造を実装するにはどうすればよいですか?

public class Tree<T> {
    private Node<T> root;

    public Tree(T rootData) {
        root = new Node<>();
        root.data = rootData;
        root.children = new ArrayList<>();
    }

    public static class Node<T> {
        private T data;
        private Node<T> parent;
        private List<Node<T>> children;
    }
}

public List<String> getChildrenStrings() {
    List<String> childStrings = new ArrayList<>();
    for (Node<T> child : children) {
        childStrings.add(child.data);
    }
    return childStrings;
}

Tree<String> myTree = new Tree<>("Root");

myTree.root.addChild("Child 1");
myTree.root.addChild("Child 2");

List<String> childStrings = myTree.root.getChildrenStrings();