forked from ngiengkianyew/daily-coding-problem
-
Notifications
You must be signed in to change notification settings - Fork 0
/
problem_146.py
42 lines (33 loc) · 905 Bytes
/
problem_146.py
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
class Node:
def __init__(self, val):
self.val = val
self.left = None
self.right = None
def __repr__(self):
string = "{}=[l={}, r={}]".format(self.val, self.left, self.right)
return string
def prune(self):
if not self.left and not self.right and not self.val:
return None
if self.left:
self.left = self.left.prune()
if self.right:
self.right = self.right.prune()
return self
# Tests
root = Node(0)
root.left = Node(1)
root.right = Node(0)
root.right.left = Node(1)
root.right.right = Node(0)
root.right.left.left = Node(0)
root.right.left.right = Node(0)
assert root.right.right
assert root.right.left.left
assert root.right.left.right
root.prune()
assert not root.right.right
assert not root.right.left.left
assert not root.right.left.right
assert root.left
assert root.right