def inorder_traversal(node):
    """
    recursive implementation of inorder traversal in which root is processed after left child and before right child
    :param node: Node of a binary tree
    """
    if node is None:
        return None

    inorder_traversal(node.left)
    print(node.value)
    inorder_traversal(node.right)