Commit f7b4179

author

iamminji

committed

[20220817] binary search Runtime: 127 ms / Memory Usage: 14.7 MB

1 parent cf94ef1 commit f7b4179Copy full SHA for f7b4179

File tree

+32

-0

lines changed

+32

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+# https://leetcode.com/problems/evaluate-boolean-binary-tree/`
	`2`	`+# 2331. Evaluate Boolean Binary Tree`
	`3`	`+`
	`4`	`+from typing import Optional`
	`5`	`+`
	`6`	`+`
	`7`	`+# Definition for a binary tree node.`
	`8`	`+class TreeNode:`
	`9`	`+ def __init__(self, val=0, left=None, right=None):`
	`10`	`+ self.val = val`
	`11`	`+ self.left = left`
	`12`	`+ self.right = right`
	`13`	`+`
	`14`	`+`
	`15`	`+class Solution:`
	`16`	`+`
	`17`	`+ def dfs(self, node:TreeNode):`
	`18`	`+ if node is None:`
	`19`	`+ return False`
	`20`	`+ if node.val == 2:`
	`21`	`+ return self.dfs(node.left) or self.dfs(node.right)`
	`22`	`+ if node.val == 3:`
	`23`	`+ return self.dfs(node.left) and self.dfs(node.right)`
	`24`	`+ if node.val == 1:`
	`25`	`+ return True`
	`26`	`+ return False`
	`27`	`+`
	`28`	`+ def evaluateTree(self, root: Optional[TreeNode]) -> bool:`
	`29`	`+ if root is not None:`
	`30`	`+ return self.dfs(root)`
	`31`	`+ # never reached`
	`32`	`+ return None`

Comments

(0)