mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-24 05:21:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update basic_binary_tree.py (#748)

Browse Source
This commit is contained in:
Ahish 2019-04-07 21:23:50 +05:30 committed by John Law
parent 15bc87fb41
commit 56de3df784
1 changed files with 16 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
binary_tree/basic_binary_tree.py
View File

@ -4,6 +4,20 @@ class Node: # This is the Class Node with constructor that contains data variabl
self.left = None self.left = None
self.right = None self.right = None
def display(tree): #In Order traversal of the tree
if tree is None:
return
if tree.left is not None:
display(tree.left)
print(tree.data)
if tree.right is not None:
display(tree.right)
return
def depth_of_tree(tree): #This is the recursive function to find the depth of binary tree. def depth_of_tree(tree): #This is the recursive function to find the depth of binary tree.
if tree is None: if tree is None:
@ -41,6 +55,8 @@ def main(): # Main func for testing.
print(is_full_binary_tree(tree)) print(is_full_binary_tree(tree))
print(depth_of_tree(tree)) print(depth_of_tree(tree))
print("Tree is: ")
display(tree)
if __name__ == '__main__': if __name__ == '__main__':