Problem $1.[25$pt$]$

Consider the following Binary Search Tree $($BST$).$ Provide the sequence of elements that will be

visited when traversing a BST using preorder, inorder, and postorder traversal algorithms.

Problem $2.[25$pt$]$

What are the differences between recursive and iterative approaches when searching for a node

in a binary search tree $($BST$)?$ Can you provide an example of how you would implement each

approach to find a specific node in a given binary search tree? Discuss the time complexity of

the each method.