각 노드를 상위 노드에 대한 참조와 함께 저장하십시오. 자식 노드로 노드를 추가 할 때 추가되는 노드에서 부모 노드까지 걸어 가서 모든 자식 노드에서 부모 참조를 None
으로 설정 한 후 세 번째 노드를 삭제하십시오. 그런 다음 삭제 된 노드의 하위를 트리 목록에 추가하십시오.
class Node(object):
depth = 4
def __init__(self, parent, contents):
self.parent = parent
self.contents = contents
self.children = []
def create_node(trees, parent, contents):
"""Adds a leaf to a specified node in the set of trees.
Note that it has to have access to the container that holds all of the trees so
that it can delete the appropriate parent node and add its children as independent
trees. Passing it in seems a little ugly. The container of trees could be a class
with this as a method or you could use a global list. Or something completely
different. The important thing is that if you don't delete every reference to the
old root, you'll leak memory.
"""
parent.children.append(Node(parent, contents))
i = 0:
L = Node.depth - 1
while i < L:
parent = parent.parent
if not parent:
break
i += 1
else:
for node in parent.children:
node.parent = None
trees.extend(parent.children)
i = trees.find(parent)
del trees[i]
이것은 내가 찾고있는 것과 같았습니다. 감사! – Theodor