用 Python 如何实现树形数据结构？自己琢磨半天总感觉写的不对

class Node:
    def __init__(self, xxx):
        self.parent
        self.children
        self.title
        self.data

class MyTree:
    def __init__(self, data):
        self.root_node = Node(xxx)
        for line in data:
            ???

tree = MyTree(data=data)

root_node = tree.get_root()

if root_node.exists_child(condition):
    such_node = root_node.query(condition)
    if such_node.exists_child(xxx):
        print('found!')
else:
    print('not exists!')

感觉和爬虫用的 lxml.etree 很像，有什么现成的轮子吗？看了 anytree ，感觉不太理想，或者请大佬指教一下写法

Data

self

节点

root_node

5 条回复 • 2022-01-11 18:18:00 +08:00

liprais

2022-01-11 17:32:15 +08:00

接邻表呗

ipwx

2022-01-11 17:38:07 +08:00

node_map = {}

for line in data:
....node = Node(...)
....node_map[node.parent_id].children.append(node)
....node_map[node.id] = node

meiyoumingzi6

2022-01-11 18:16:51 +08:00

之前写过一个, 不知道是否满足你的需求

class Node:
def __init__(self, val, left=None, right=None) -> None:
self.val = val
self.left = left
self.right = right

def create_tree(data: list):
if not data:
return None
first_node = Node(data[0])
tmp_list = [first_node]
tmp_count = 0
for item in data[1:]:
node = tmp_list[0]
new_node = Node(item) if item is not None else None
if tmp_count == 0:
node.left = new_node
# add to tmp_list
if item is not None:
tmp_list.append(new_node)
tmp_count += 1
continue
if tmp_count == 1:
node.right = new_node
if item is not None:
tmp_list.append(new_node)
# POP
tmp_list.pop(0)
tmp_count = 0
continue
return first_node

meiyoumingzi6

2022-01-11 18:17:10 +08:00

```python

class Node:
def __init__(self, val, left=None, right=None) -> None:
self.val = val
self.left = left
self.right = right

def create_tree(data: list):
if not data:
return None
first_node = Node(data[0])
tmp_list = [first_node]
tmp_count = 0
for item in data[1:]:
node = tmp_list[0]
new_node = Node(item) if item is not None else None
if tmp_count == 0:
node.left = new_node
# add to tmp_list
if item is not None:
tmp_list.append(new_node)
tmp_count += 1
continue
if tmp_count == 1:
node.right = new_node
if item is not None:
tmp_list.append(new_node)
# POP
tmp_list.pop(0)
tmp_count = 0
continue
return first_node
```

meiyoumingzi6

2022-01-11 18:18:00 +08:00

淦格式老错,

自己上我博客看吧

https://blog.yujichenfeng.ml/posts/algorithm/tree/