-
Notifications
You must be signed in to change notification settings - Fork 0
/
TreeNode1.py
137 lines (121 loc) · 2.52 KB
/
TreeNode1.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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
__author__ = 'Connor'
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
self.next = None
def consturctdefault():
root = TreeNode(5)
lc = TreeNode(4)
rc = TreeNode(8)
root.left = lc
root.right = rc
lc.left = TreeNode(11)
lc = lc.left
lc.left = TreeNode(7)
lc.right = TreeNode(2)
rc.left = TreeNode(13)
rc.right = TreeNode(4)
rc = rc.right
rc.right = TreeNode(1)
return root
def constructdefault1():
root = TreeNode(5)
lc = TreeNode(4)
rc = TreeNode(8)
root.left = lc
root.right = rc
lc.left = TreeNode(11)
lc = lc.left
lc.left = TreeNode(7)
lc.right = TreeNode(2)
rc.left = TreeNode(13)
rc.right = TreeNode(4)
rc = rc.right
rc.left = TreeNode(5)
rc.right = TreeNode(1)
return root
def constructBST():
root =TreeNode(3)
p1 = TreeNode(1)
p2 = TreeNode(5)
p3 = TreeNode(0)
p4 = TreeNode(2)
p5 = TreeNode(4)
p6 = TreeNode(6)
root.left = p1
root.right = p2
p1.left = p3
p1.right = p4
p2.left = p5
p2.right = p6
return root
def contstructFlatten():
p1 = TreeNode(1)
p2 = TreeNode(2)
p3 = TreeNode(3)
p4 = TreeNode(4)
p5 = TreeNode(5)
p6 = TreeNode(6)
p1.left = p2
p1.right = p5
p2.left = p3
p2.right = p4
p5.right = p6
return p1
def constructUnbalanced():
root = TreeNode(0)
p1 = TreeNode(1)
p2 = TreeNode(2)
p3 = TreeNode(3)
p4 = TreeNode(4)
p5 = TreeNode(5)
p6 = TreeNode(6)
p7 = TreeNode(7)
root.left = p1
root.right = p2
p1.left = p3
p1.right = p4
p2.right = p5
p3.left = p6
p6.left = p7
return root
def constructSymmeric():
root = TreeNode(1)
p1 = TreeNode(2)
p2 = TreeNode(2)
p3 = TreeNode(3)
p4 = TreeNode(4)
p5 = TreeNode(4)
p6 = TreeNode(3)
root.left = p1
root.right = p2
p1.left = p3
p1.right = p4
p2.left = p5
p2.right = p6
return root
def printTree(root):
p = root
print(p.val)
if p.left!=None:
printTree(p.left)
if p.right != None:
printTree(p.right)
def preOrder(root):
ans = []
p = root
stack = []
while p != None or stack != []:
while p != None:
stack.append(p)
ans.append(p.val)
p=p.left
if stack != []:
p = stack.pop()
p = p.right
return ans
if __name__ == '__main__':
tt = consturctdefault()
printTree(tt)