接前-中序遍历二叉树（非递归）

import java.util.Stack;

class Node {
    int data;
    Node left, right;
    Node(int item) {
        data = item;
        left = right = null;
    }
}
class BinaryTree {
    Node root;
    public void iterativeMidOrder(){
        Stack<Node> s = new Stack<>();
        Node p=root;
        while(p!=null ||!s.isEmpty())
        {
            while(p!=null)
            {
                s.push(p);
                p=p.left;
            }
            if(!s.empty())
            {
                p=s.peek();
                System.out.println(p.data);
                s.pop();
                p=p.right;
            }
        }
    }

}

public class Solution {

}