x/box-o-sand
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Return the correct right-connected binary tree root

Browse Source
This commit is contained in:
Dan Buch 2023-10-21 16:19:13 -04:00
parent dc9c3fd54d
commit e92d117a41
Signed by: meatballhat
GPG Key ID: A12F782281063434
1 changed files with 11 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
leetcode/stuff.py
View File

@ -211,16 +211,24 @@ def connect_binary_tree_right(
by_level = binary_tree_by_level(copy.deepcopy(root)) by_level = binary_tree_by_level(copy.deepcopy(root))
serialized: list[int | None] = [] serialized: list[int | None] = []
for _, nodes in sorted(by_level.items(), key=lambda p: p[0]): print("")
if 0 not in by_level or len(by_level[0]) == 0:
return None, []
connected_root = by_level[0][0]
for level, nodes in sorted(by_level.items(), key=lambda p: p[0]):
for i in range(len(nodes)): for i in range(len(nodes)):
serialized.append(nodes[i].val) serialized.append(nodes[i].val)
if len(nodes) < i: if len(nodes) > i + 1:
print(f"{'-' * level}> connecting {nodes[i].val} -> {nodes[i + 1].val}")
nodes[i].next = nodes[i + 1] nodes[i].next = nodes[i + 1]
serialized.append(None) serialized.append(None)
return root, serialized return connected_root, serialized
def binary_tree_by_level(root: stdlib.Node) -> dict[int, list[stdlib.Node]]: def binary_tree_by_level(root: stdlib.Node) -> dict[int, list[stdlib.Node]]: