Add the Python codes for the chapter of Graph and Heap (#382)

This commit is contained in:
Yudong Jin
2023-02-23 20:00:40 +08:00
committed by GitHub
parent 776f2d82bb
commit 1f4dba4845
10 changed files with 553 additions and 5 deletions

View File

@ -6,7 +6,7 @@ Author: Krahets (krahets@163.com), msk397 (machangxinq@gmail.com)
import copy
import queue
from .binary_tree import TreeNode, tree_to_list
from .binary_tree import TreeNode, tree_to_list, list_to_tree
from .linked_list import ListNode, linked_list_to_list
def print_matrix(mat):
@ -80,4 +80,10 @@ def print_dict(d):
d ([type]): [description]
"""
for key, value in d.items():
print(key, '->', value)
print(key, '->', value)
def print_heap(heap):
print("堆的数组表示:", heap);
print("堆的树状表示:");
root = list_to_tree(heap)
print_tree(root);