mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-21 16:52:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

travis cli build fail

Browse Source
This commit is contained in:
Akshay Sharma 2016-10-14 01:27:52 +05:30
parent 887f9e5b01
commit d62e8e2868
1 changed files with 4 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
traverals/binary_tree_traversals.py
View File

@ -6,7 +6,6 @@ import queue
class TreeNode: class TreeNode:
def __init__(self, data): def __init__(self, data):
self.data = data self.data = data
self.right = None self.right = None
@ -49,8 +48,7 @@ def pre_order(node):
def in_order(node): def in_order(node):
if not isinstance(node, TreeNode) or not node: if not isinstance(node, TreeNode) or not node:
print("Invalid input")
return return
in_order(node.left) in_order(node.left)
print(node.data, end=" ") print(node.data, end=" ")
@ -58,8 +56,7 @@ def in_order(node):
def post_order(node): def post_order(node):
if not isinstance(node, TreeNode) or not node: if not isinstance(node, TreeNode) or not node:
print("Invalid input")
return return
post_order(node.left) post_order(node.left)
post_order(node.right) post_order(node.right)
@ -67,8 +64,7 @@ def post_order(node):
def level_order(node): def level_order(node):
if not isinstance(node, TreeNode) or not node: if not isinstance(node, TreeNode) or not node:
print("Invalid input")
return return
q = queue.Queue() q = queue.Queue()
q.put(node) q.put(node)
@ -83,6 +79,7 @@ def level_order(node):
if __name__ == '__main__': if __name__ == '__main__':
import sys import sys
print("\n********* Binary Tree Traversals ************\n") print("\n********* Binary Tree Traversals ************\n")
# For python 2.x and 3.x compatibility: 3.x has not raw_input builtin # For python 2.x and 3.x compatibility: 3.x has not raw_input builtin
# otherwise 2.x's input builtin function is too "smart" # otherwise 2.x's input builtin function is too "smart"