-
Notifications
You must be signed in to change notification settings - Fork 0
/
binarytree.py
65 lines (52 loc) · 1.54 KB
/
binarytree.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
class Stack:
def __init__(self):
self.values = []
def isEmpty(self):
Empty = False
if self.values == []:
Empty = True
return Empty
def push(self, value):
self.values.append(value)
def pop(self):
return self.values.pop()
def peek(self):
return self.values[len(self.values)-1]
def size(self):
return len(self.values)
class NodeTree:
def __init__(self, value):
self.left = None
self.right = None
self.value = value
def insert(self,value):
if self.value:
if value < self.value:
if self.left is None:
self.left = NodeTree(value)
else:
self.left.insert(value)
elif value > self.value:
if self.right is None:
self.right = NodeTree(value)
else:
self.right.insert(value)
else:
self.value = value
def findval(self, value):
if value < self.value:
if self.left is None:
return False
return self.left.findval(value)
elif value > self.value:
if self.right is None:
return False
return self.right.findval(value)
else:
return True
def displayTree(self):
if self.left:
self.left.displayTree()
return self.value,
if self.right:
self.right.displayTree()