Initialize an empty stack and push the root node onto it.
Initialize a variable total to 0 to keep track of the sum of left leaves.
While the stack is not empty:
a. Pop the top node from the stack.
b. If the left child of the node is a leaf, add its value to total.
c. Push the right child of the node onto the stack (if it exists).
d. Push the left child of the node onto the stack (if it exists).