Repository navigation
Expand file tree
/
Copy pathPerfect_Binary_Tree.py
More file actions
76 lines (71 loc) · 2.88 KB
/
Copy pathPerfect_Binary_Tree.py
File metadata and controls
76 lines (71 loc) · 2.88 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
def add (self, data):
if self.data == data:
return
if self.data > data:
if self.left:
self.left.add(data)
else:
self.left = Node(data)
else:
if self.right:
self.right.add(data)
else:
self.right = Node(data)
class Binary_Tree:
def __init__(self):
self.root = None
def is_perfect_tree(self, root):
if root is None:
return True
if root.left is None and root.right is None:
return True
if root.left is not None and root.right is not None:
return self.is_perfect_tree(root.left) and self.is_perfect_tree(root.right)
return False
"""
Here if there is a node with only one child, then it is not a perfect binary tree.
If there is a node with no child, then it is a perfect binary tree.
So, we check if the node has both children, then we recursively check for the left and right subtrees.
"""
if __name__ == '__main__':
tree = Binary_Tree()
tree.root = Node(1)
tree.root.left = Node(2)
tree.root.right = Node(3)
tree.root.left.left = Node(4)
tree.root.left.right = Node(5)
tree.root.right.left = Node(6)
tree.root.right.right = Node(7)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right = Node(8)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.left = Node(9)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right = Node(10)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right = Node(11)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.left = Node(12)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.right = Node(13)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.right.left = Node(14)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.right.right = Node(15)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.right.right.left = Node(16)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.right.right.right = Node(17)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.right.right.right.left = Node(18)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.right.right.right.right = Node(19)
print(tree.is_perfect_tree(tree.root))
tree.root.right.right.right.right.right.right.right.right.right.left = Node(20)
print(tree.is_perfect_tree(tree.root))
tree.root