xxxxxxxxxx
class Node:
def __init__(self, key):
self.left = None
self.right = None
self.val = key
def printPostorder(root):
if root:
printPostorder(root.left)
printPostorder(root.right)
print(root.val)
if __name__ == "__main__":
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)
print("\n Preorder traversal of binary tree is")
printPostorder(root)
xxxxxxxxxx
class Node:
def __init__(self, key):
self.left = None
self.right = None
self.val = key
def printPreorder(root):
if root:
print(root.val)
printPreorder(root.left)
printPreorder(root.right)
if __name__ == "__main__":
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)
print("\n Preorder traversal of binary tree is")
printPreorder(root)
xxxxxxxxxx
def inorder(n):
if n.left:
inorder(n.left)
print(n.val)
if n.right:
inorder(n.right)
xxxxxxxxxx
def post_order(T, nid):
for child in T.children(nid):
post_order(T, child.identifier)
print(T.get_node(nid).data)