Binary Tree Traversal using Iterative and Recursive Methods

Given a binary tree, write both recursive and iterative implementations of preorder traversal. Also produce every path that begins at the root and ends at a leaf. Implement the following functions: The two named functions should return the root-to-leaf paths. Each path should be represented as a string containing the node values in order, joined with ->. Examples Example 1 Input: Output: The preorder visit processes the root before its left and right subtrees, while the two…