FilesExpand file tree

 main

/

BinaryTreeLevelOrderTraversal.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

27 lines (26 loc) · 829 Bytes

 main

/

BinaryTreeLevelOrderTraversal.py

Copy path

Top

File metadata and controls

• Code
• Blame

27 lines (26 loc) · 829 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

# https://leetcode.com/problems/binary-tree-level-order-traversal/

# Definition for a binary tree node.

# class TreeNode:

# def __init__(self, val=0, left=None, right=None):

# self.val = val

# self.left = left

# self.right = right

class Solution:

def levelOrder(self, root: TreeNode) -> List[List[int]]:

if not root:

return list()

levels=[]

q=[(0,root)]

res=[]

while q:

cur=q[0]

if cur[0] not in levels:

levels.append(cur[0])

res.append([])

res[cur[0]].append(cur[1].val)

del q[0]

if cur[1].left:

q.append((cur[0]+1,cur[1].left))

if cur[1].right:

q.append((cur[0]+1,cur[1].right))

return res