write psuedocode for one of the classic traversal algorithms(preorder inorder an

write psuedocode for one of the classic traversal algorithms(preorder inorder and postorder) for binary trees. Assuming that your algorithm is recursive find the number of recursive calls made.