先序:直接用stack遍历,vis当前元素后按顺序压栈右儿子,压栈左儿子
中序:压栈当前节点后接着压栈左儿子,当左儿子为空时vis栈顶元素,压栈栈顶元素的右儿子
Stack<TreeNode> s = new Stack<>();
TreeNode head = root;
while(!s.empty() || head!=null){
if(head!=null){
s.push(head);
head = head.left;
}else{
head = s.pop();
vis(head);
head = head.right;
}
while有两个继续的条件 栈不为空(说明还有元素没vis),head不为空(还有等待压栈的元素)
后序:两个栈,记为ab。压root进a,每次取出栈顶元素时,压入b,接着按顺序压栈左儿子 ,右儿子人a. 直到a为空
最后b弹出顺序为后序遍历
Stack<TreeNode> s1 = new Stack<>();
Stack<TreeNode> s2 = new Stack<>();
TreeNode head = root;
s1.push(head);
while(!s1.empty()){
head = s1.pop();
s2.push(head);
if(head.left!=null)
s1.push(head.left)
if(head.right!=null)
s1.push(head.right)
}