修复Python中的深度树
我想实现一个具有固定深度的树结构,即当向叶节点添加子节点时,整个树结构应该“向上移动”。这也意味着多个根可以同时存在。请参阅下面的示例: 在此示例中,绿色节点在迭代 1 中添加,删除顶部节点(灰色)并在 K=0 处创建两个蓝色节点并成为迭代 1 的根节点。
我该如何实施呢?
I want to implement a tree structure which has fixed depth, i.e. when adding children to the leef nodes, the whole tree structure should "move up". This also means that several roots can exist simultaneously. See example beneath:
In this example, the green nodes are added in iteration 1, deleting the top node (grey) and making the two blue nodes at K=0 and Iteration 1 root nodes.
How do I go about implementing this?
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(1)
存储每个节点及其父节点的引用。当您将一个节点作为子节点添加到其中时,请向上遍历父节点(从要添加到的节点),并在将其所有子节点中的父引用设置为
None
后删除第三个节点。然后将已删除节点的子节点添加到树列表中。Store each node with a reference to its parent. When you add a node to it as a child, walk up the parents (from the node being added to) and delete the third one after you set the parent reference in all of its children to
None
. Then add the children of the deleted node to your list of trees.