DFSinorder.py

def inorder(root,visited):
 	if root: #check if node exits
 		visited=inorder(root.left,traversal) #go to left subtree (L)
 		visited.append(root.data) #append node value to visted stack (V)
 		visited=inorder(root.right,traversal) #go to right subtree (R)
 	return visited #return visited stack
inorder(root,[]) #call inorder function with visited stack