Iterative Binary Tree Post-order Traversal

IterativeBinaryTreePostOrder.java

//Given a binary tree, return the postorder traversal of its nodes' values.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
      TreeNode node = root;
      Stack<TreeNode> stack = new Stack<TreeNode>();
      LinkedList<Integer> retList = new LinkedList<Integer>();
      while (true){
        if (node != null){
          retList.addFirst(node.val);
          stack.push(node);
          node = node.right;
        }else{
          if (stack.empty()){
            return retList;
          }
          node = stack.pop();
          node = node.left;
        }
      }
        
    }
}