Commit 04b285e

authored

Update Insert_into_Binary_Search_Tree.py

1 parent e88eb19 commit 04b285eCopy full SHA for 04b285e

File tree

+13

-2

lines changed

+13

-2

lines changed

Lines changed: 13 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`		`-# Time: O(N) and Space: O(1)`
`2`		`-`
	`1`	`+""" Time: O(N) and Space: O(1) """`
	`2`	`+# Iterative Solution`
`3`	`3`	`class Solution:`
`4`	`4`	`def insertIntoBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:`
`5`	`5`	`if root is None:`
`@@ -22,3 +22,14 @@ def insertIntoBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode`
`22`	`22`
`23`	`23`	`return root`
`24`	`24`
	`25`	`+`
	`26`	`+# Recursive Solution`
	`27`	`+class Solution:`
	`28`	`+ def insertIntoBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:`
	`29`	`+ if root is None:`
	`30`	`+ root = TreeNode(val)`
	`31`	`+ elif root.val < val:`
	`32`	`+ root.right = self.insertIntoBST(root.right, val)`
	`33`	`+ else:`
	`34`	`+ root.left = self.insertIntoBST(root.left, val)`
	`35`	`+ return root`

Comments

(0)