def __init__(self):
self.arrayList = ArrayList()
self.size = 0
self.rootIndex = 0
self.lastIndex = 0
class BinaryTree(object):
def __init__(self):
self.arrayList = ArrayList()
self.size = 0
self.rootIndex = 0
self.lastIndex = 0
def getSize(self):
return self.size
def isEmpty(self):
return self.size == 0
def insert(self, data):
if self.isEmpty():
self.rootIndex = 1
if (self.arrayList.get(self.rootIndex)) is None:
self.arrayList.replace(self.rootIndex, data)
self.lastIndex = self.rootIndex
elif (self.arrayList.get(self.rootIndex * 2)) is None:
self.arrayList.replace(self.rootIndex * 2, data)
self.lastIndex = self.rootIndex * 2
elif (self.arrayList.get(self.rootIndex * 2 + 1)) is None:
self.arrayList.replace(self.rootIndex * 2 + 1, data)
self.lastIndex = self.rootIndex * 2 + 1
self.rootIndex += 1
self.size += 1
def deleteLast(self):
temp = self.arrayList.get(self.lastIndex)
self.arrayList.delete(self.lastIndex)
return temp
def getContent(self):
result = []
for i in range(self.arrayList.capacity):
result.append(self.arrayList.get(i))
print(result)
def hasLeft(self, index):
return self.arrayList.get(index * 2) is not None
def hasRight(self, index):
return self.arrayList.get(index * 2 + 1) is not None
def isLeaf(self, index):
return not (self.hasRight(index) | self.hasLeft(index))
# Traversing Algorithms
def preOrder(self, rootIndex):
if self.isEmpty():
return None
elif self.isLeaf(rootIndex):
print(self.arrayList.get(rootIndex))
else:
print(self.arrayList.get(rootIndex))
if self.hasLeft(rootIndex):
self.preOrder(rootIndex * 2)
if self.hasRight(rootIndex):
self.preOrder(rootIndex * 2 + 1)
def postOrder(self, rootIndex):
if self.isEmpty():
return None
elif self.isLeaf(rootIndex):
print(self.arrayList.get(rootIndex))
else:
if self.hasLeft(rootIndex):
self.postOrder(rootIndex * 2)
if self.hasRight(rootIndex):
self.postOrder(rootIndex * 2 + 1)
print(self.arrayList.get(rootIndex))
def inOrder(self, rootIndex):
if self.isEmpty():
return None
elif self.isLeaf(rootIndex):
print(self.arrayList.get(rootIndex))
else:
if self.hasLeft(rootIndex):
self.inOrder(rootIndex * 2)
print(self.arrayList.get(rootIndex))
if self.hasRight(rootIndex):
self.inOrder(rootIndex * 2 + 1)
