For an iterative solution, use a stack to simulate the recursion. Push the root node first, then process nodes by popping from the stack, adding their values to the result, and pushing right child followed by left child (to ensure left is processed next).