Commit 1b951c4

authored

Update Day-23_Two Sum IV - Input is a BST.py

1 parent 6e3e427 commit 1b951c4Copy full SHA for 1b951c4

File tree

-1

lines changed

Leetcode_30day_challenge/August_Challenge_2021
- Day-23_Two Sum IV - Input is a BST.py

-1

lines changed

Lines changed: 3 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`# TC: O(N) \| SC: O(N)`
`2`		`-`
	`2`	`+# Method - 1: Traverse the BST, store the nodes values in a Dictionary. Then find the sum of two numbers equals target.`
`3`	`3`	`from collections import defaultdict`
`4`	`4`	`class Solution:`
`5`	`5`	`def findTarget(self, root: Optional[TreeNode], k: int) -> bool:`
`@@ -22,3 +22,5 @@ def inorder(root, d):`
`22`	`22`
`23`	`23`	`return False`
`24`	`24`
	`25`	`+# Method - 2: Since it is a BST, for every element we can search for the element b (b = target - node.val) in O(H) Time.`
	`26`	`+# TC: O(N) and space will now be O(H) [Best: logN and Worst: N]`

Comments

(0)