no_sibling_tree.py

# Problem: Print the nodes of a binary tree
# which do not have a sibling


classNode:
def__init__(self, data):
self.data=data
self.left=None
self.right=None


defprintSingleNode(root, hasSibling):
# hasSibling will check if root has both children
ifrootisNone:
return
else:
# if root has one child, print that child data
ifnothasSibling:
print("%d"%root.data)

printSingleNode(root.left, root.rightisnotNone)
printSingleNode(root.right, root.leftisnotNone)


root=Node(1)
root.left=Node(2)
root.right=Node(3)
root.left.left=Node(4)
root.right.left=Node(5)
root.right.left.left=Node(6)

print("Level order traversal of binary tree is -")
printSingleNode(root, True)