In class, we discussed the preorder traversal of a binary tree. The code below is recursive.

def preorder(root):

if root:

print(root.val)

preorder(root.left)

preorder(root.right)

Rewrite the preorder function such that it returns the nodes values in a Python list instead of printing them out, and it is iterative instead of recursive.