mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
48 lines
1.1 KiB
Python
48 lines
1.1 KiB
Python
class Node:
|
|
def __init__(self, data):
|
|
self.data = data
|
|
self.left = None
|
|
self.right = None
|
|
|
|
|
|
def depth_of_tree(tree):
|
|
if tree is None:
|
|
return 0
|
|
else:
|
|
depth_l_tree = depth_of_tree(tree.left)
|
|
depth_r_tree = depth_of_tree(tree.right)
|
|
if depth_l_tree > depth_r_tree:
|
|
return 1 + depth_l_tree
|
|
else:
|
|
return 1 + depth_r_tree
|
|
|
|
|
|
def is_full_binary_tree(tree):
|
|
if tree is None:
|
|
return True
|
|
if (tree.left is None) and (tree.right is None):
|
|
return True
|
|
if (tree.left is not None) and (tree.right is not None):
|
|
return (is_full_binary_tree(tree.left) and is_full_binary_tree(tree.right))
|
|
else:
|
|
return False
|
|
|
|
|
|
def main():
|
|
tree = Node(1)
|
|
tree.left = Node(2)
|
|
tree.right = Node(3)
|
|
tree.left.left = Node(4)
|
|
tree.left.right = Node(5)
|
|
tree.left.right.left = Node(6)
|
|
tree.right.left = Node(7)
|
|
tree.right.left.left = Node(8)
|
|
tree.right.left.left.right = Node(9)
|
|
|
|
print(is_full_binary_tree(tree))
|
|
print(depth_of_tree(tree))
|
|
|
|
|
|
if __name__ == '__main__':
|
|
main()
|