Question: 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
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.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
