-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathcount_leaves_on_binary_tree.py
More file actions
65 lines (51 loc) · 1.17 KB
/
count_leaves_on_binary_tree.py
File metadata and controls
65 lines (51 loc) · 1.17 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
#Count leaves
from binaryNode import *
from collections import deque
root = Node(1)
node2 = Node(2)
node3 = Node(3)
node4 = Node(4)
node5 = Node(5)
node6 = Node(6)
node7 = Node(7)
node8 = Node(8)
node9 = Node(9)
root.left = node2
root.right = node3
node2.left = node4
node4.right = node5
node3.left = node6
node3.right = node7
node6.left = node8
node6.right = node9
def count_leaves(root):
if(root == None):
return
queue = deque([])
queue.append(root)
count = 0
while(len(queue)>0):
node = queue.popleft()
if(node.left != None):
queue.append(node.left)
if(node.right != None):
queue.append(node.right)
if(node.left == None and node.right == None):
count+= 1
return count
def count_full_nodes(root):
if(root == None):
return
queue = deque([])
queue.append(root)
count = 0
while(len(queue)>0):
node = queue.popleft()
if(node.left != None):
queue.append(node.left)
if(node.right != None):
queue.append(node.right)
if(node.left != None and node.right != None):
count+= 1
return count
print count_full_nodes(root)