Commitdb4d80f

authored

Merge pull requestneetcode-gh#2904 from sahasourav17/main

Create: 0103-binary-tree-zigzag-level-order-traversal.py

2 parentsaa97117 +efa71df commitdb4d80fCopy full SHA for db4d80f

File tree

+39

-0

lines changed

+39

-0

lines changed

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,24 @@`
	`1`	`+# Definition for a binary tree node.`
	`2`	`+# class TreeNode:`
	`3`	`+# def __init__(self, val=0, left=None, right=None):`
	`4`	`+# self.val = val`
	`5`	`+# self.left = left`
	`6`	`+# self.right = right`
	`7`	`+classSolution:`
	`8`	`+defzigzagLevelOrder(self,root:Optional[TreeNode])->List[List[int]]:`
	`9`	`+ifrootisNone:`
	`10`	`+return`
	`11`	`+result,zigzagDirection= [],1`
	`12`	`+q= [root]`
	`13`	`+whileq:`
	`14`	`+level,queueLength= [],len(q)`
	`15`	`+foriinrange(queueLength):`
	`16`	`+node=q.pop(0)`
	`17`	`+level.append(node.val)`
	`18`	`+ifnode.left:`
	`19`	`+q.append(node.left)`
	`20`	`+ifnode.right:`
	`21`	`+q.append(node.right)`
	`22`	`+result.append(level[::zigzagDirection])`
	`23`	`+zigzagDirection*=-1`
	`24`	`+returnresult`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+# Definition for a binary tree node.`
	`2`	`+# class TreeNode:`
	`3`	`+# def __init__(self, val=0, left=None, right=None):`
	`4`	`+# self.val = val`
	`5`	`+# self.left = left`
	`6`	`+# self.right = right`
	`7`	`+classSolution:`
	`8`	`+defsortedArrayToBST(self,nums:List[int])->Optional[TreeNode]:`
	`9`	`+ifnotnums:`
	`10`	`+returnNone`
	`11`	`+mid=len(nums)//2`
	`12`	`+root=TreeNode(nums[mid])`
	`13`	`+root.left=self.sortedArrayToBST(nums[:mid])`
	`14`	`+root.right=self.sortedArrayToBST(nums[mid+1:])`
	`15`	`+returnroot`

Comments

(0)