mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 15:01:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

added isinstance check

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

12
traverals/binary_tree_traversals.py
View File

@ -40,7 +40,8 @@ def build_tree():
def pre_order(node): def pre_order(node):
if not node: if not isinstance(node, TreeNode) or not node:
print("Invalid input")
return return
print(node.data, end=" ") print(node.data, end=" ")
pre_order(node.left) pre_order(node.left)
@ -48,7 +49,8 @@ def pre_order(node):
def in_order(node): def in_order(node):
if 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=" ")
@ -56,7 +58,8 @@ def in_order(node):
def post_order(node): def post_order(node):
if 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)
@ -64,7 +67,8 @@ def post_order(node):
def level_order(node): def level_order(node):
if 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)