Replace node in immutable tree

I have a tree structure akin to this:

record Tree(IReadOnlyCollection<Node> Roots, IReadOnlyDictionary<string, Node> Nodes);
record Node(string Name, IReadOnlyDictionary<string, Node> Children);

record Tree(IReadOnlyCollection<Node> Roots, IReadOnlyDictionary<string, Node> Nodes);
record Node(string Name, IReadOnlyDictionary<string, Node> Children);

I wanna have a method

Tree ReplaceNode(this Tree tree, Node oldNode, Node newNode)

Tree ReplaceNode(this Tree tree, Node oldNode, Node newNode)

to replace nodes in this tree (i.e. return a new tree with a node replaced), but I have no idea how to do this efficiently. Is there some common algorithm or something for this?

C#•4y ago•

19 replies

Thinker

Replace node in immutable tree

I have a tree structure akin to this:

record Tree(IReadOnlyCollection<Node> Roots, IReadOnlyDictionary<string, Node> Nodes);
record Node(string Name, IReadOnlyDictionary<string, Node> Children);

record Tree(IReadOnlyCollection<Node> Roots, IReadOnlyDictionary<string, Node> Nodes);
record Node(string Name, IReadOnlyDictionary<string, Node> Children);

I wanna have a method

Tree ReplaceNode(this Tree tree, Node oldNode, Node newNode)

Tree ReplaceNode(this Tree tree, Node oldNode, Node newNode)

to replace nodes in this tree (i.e. return a new tree with a node replaced), but I have no idea how to do this efficiently. Is there some common algorithm or something for this?

Replace node in immutable tree

Similar Threads

Replace node in immutable tree

Similar Threads

Similar Threads

Similar Threads