Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update and rename tree_bfs.py to bt_bfs.py

Browse Source
This commit is contained in:
marina 2023-08-03 13:20:29 -07:00 committed by GitHub
parent 9d1aa92451
commit 070071e687
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
trees/tree_bfs.py → trees/bt_bfs.py
View File

@ -2,11 +2,8 @@
# -*- coding: utf-8 -*- # -*- coding: utf-8 -*-
# author: bt3gl # author: bt3gl
# Given the root of a binary tree, return the level order traversal of its nodes' values.
# (i.e., from left to right, level by level).
def level_order(root: Optional[Node]) -> list[list[int]]:
def level_order(root: Optional[TreeNode]) -> list[list[int]]:
if root is None: if root is None:
return [] return []