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

Update basic_binary_tree.py (#725)

Browse Source 
I have added the comments for better understanding.
This commit is contained in:
Akash Ali 2019-03-07 20:53:29 +05:00 committed by John Law
parent 6f6510623c
commit 2c67f6161c
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
binary_tree/basic_binary_tree.py
View File

@ -1,11 +1,11 @@
class Node: class Node: # This is the Class Node with constructor that contains data variable to type data and left,right pointers.
def __init__(self, data): def __init__(self, data):
self.data = data self.data = data
self.left = None self.left = None
self.right = None self.right = None
def depth_of_tree(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:
return 0 return 0
else: else:
@ -17,7 +17,7 @@ def depth_of_tree(tree):
return 1 + depth_r_tree return 1 + depth_r_tree
def is_full_binary_tree(tree): def is_full_binary_tree(tree): # This functions returns that is it full binary tree or not?
if tree is None: if tree is None:
return True return True
if (tree.left is None) and (tree.right is None): if (tree.left is None) and (tree.right is None):
@ -28,7 +28,7 @@ def is_full_binary_tree(tree):
return False return False
def main(): def main(): # Main func for testing.
tree = Node(1) tree = Node(1)
tree.left = Node(2) tree.left = Node(2)
tree.right = Node(3) tree.right = Node(3)