-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
998.py
68 lines (62 loc) · 2.26 KB
/
998.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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
__________________________________________________________________________________________________
sample 28 ms submission
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def insertIntoMaxTree(self, root: TreeNode, val: int) -> TreeNode:
def insertNode(node,valarr):
if node:
if len(valarr)!=0:
if node.val<valarr[0]:
newnode=TreeNode(valarr[0])
newnode.left=node
valarr=[]
return newnode,valarr
else:
node.left,_=insertNode(node.left,[])
node.right,valarr=insertNode(node.right,valarr)
return node,valarr
else:
node.left,_=insertNode(node.left,[])
node.right,valarr=insertNode(node.right,valarr)
return node,valarr
elif len(valarr)!=0 :
newnode=TreeNode(valarr[0])
valarr=[]
return newnode,valarr
else:
return None,valarr
root,vals=insertNode(root,[val])
return root
__________________________________________________________________________________________________
sample 13072 kb submission
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def insertIntoMaxTree(self, root: TreeNode, val: int) -> TreeNode:
if val > root.val:
node = TreeNode(val)
node.left = root
return node
else:
self.helper(root,val)
return root
def helper(self, root, val):
if root.right is None:
node = TreeNode(val)
root.right=node
elif val > root.right.val:
node = TreeNode(val)
node.left = root.right
root.right = node
else:
self.helper(root.right, val)
__________________________________________________________________________________________________