Skip to content

fix pre-order traversal, add in-order and post-order traversal#121

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
bmoyer wants to merge 2 commits into from
Closed

fix pre-order traversal, add in-order and post-order traversal #121

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
8bee866
fix pre-order traversal, add in-order and post-order traversal
bmoyer Sep 28, 2017
c006fe8
fix typo in file
bmoyer Sep 28, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
52 changes: 33 additions & 19 deletions data_structures/Binary Tree/binary_seach_tree.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -8,7 +8,7 @@ class Node:
def __init__(self, label):
self.label = label
self.left = None
self.rigt = None
self.right = None

def getLabel(self):
return self.label
Expand All@@ -23,10 +23,10 @@ def setLeft(self, left):
self.left = left

def getRight(self):
return self.rigt
return self.right

def setRight(self, right):
self.rigt = right
self.right = right


class BinarySearchTree:
Expand DownExpand Up@@ -67,12 +67,23 @@ def empty(self):
return True
return False

def preShow(self, curr_node):
if curr_node is None:
def preorderShow(self, curr_node):
if curr_node is not None:
print(curr_node.getLabel(), end=" ")
self.preorderShow(curr_node.getLeft())
self.preorderShow(curr_node.getRight())

def postorderShow(self, curr_node):
if curr_node is not None:
self.postorderShow(curr_node.getLeft())
self.postorderShow(curr_node.getRight())
print(curr_node.getLabel(), end=" ")

self.preShow(curr_node.getLeft())
self.preShow(curr_node.getRight())
def inorderShow(self, curr_node):
if curr_node is not None:
self.inorderShow(curr_node.getLeft())
print(curr_node.getLabel(), end=" ")
self.inorderShow(curr_node.getRight())

def getRoot(self):
return self.root
Expand All@@ -89,15 +100,18 @@ def getRoot(self):
4 7 13
'''

t = BinarySearchTree()
t.insert(8)
t.insert(3)
t.insert(1)
t.insert(6)
t.insert(4)
t.insert(7)
t.insert(10)
t.insert(14)
t.insert(13)

t.preShow(t.getRoot())
if __name__ == '__main__':
t = BinarySearchTree()
t.insert(8)
t.insert(3)
t.insert(1)
t.insert(6)
t.insert(4)
t.insert(7)
t.insert(10)
t.insert(14)
t.insert(13)

t.preorderShow(t.getRoot())
t.inorderShow(t.getRoot())
t.postorderShow(t.getRoot())