Leetcode 144. Binary Tree Preorder Traversal 树的前序
非递归版本的树的前序遍历,只需要保存树的右节点即可
public class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
if(root == null) return res;
TreeNode temp = root;
//只将右孩子存起来
while(temp != null){
res.add(temp.val);
if(temp.right != null)
stack.push(temp.right);
if(temp.left != null){
temp = temp.left;
}
else{
temp = stack.size() > 0 ?stack.pop():null;
}
}
return res;
}
}
Leetcode 94. Binary Tree Inorder Traversal树的中序遍历
非递归版本的中序遍历,对每一个节点node如果他有左孩子那么就把左孩子入栈,如果没有左孩子,node值进入结果List,出栈。如果这个节点有右孩子,右孩子进栈,循环操作,如果没有右孩子,继续将先下一个节点nextNode出栈,nextNode.val进入结果List,判断nextNode是否有右孩子,有和没有操作和node相同。
public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
if(root == null) return res;
stack.add(root);
while(!stack.isEmpty()){
TreeNode node = stack.peek();
if(node.left != null){
stack.push(node.left);
}
else{
node = stack.pop();
res.add(node.val);
while(!stack.isEmpty() && node.right == null){
node = stack.pop();
res.add(node.val);
}
if(node.right != null) stack.push(node.right);
}
}
return res;
}
}
Leetcode 145. Binary Tree Postorder Traversal 树的后序遍历
后序遍历的顺序是左右中,那么就一直中右左的遍历下去,然后反转就可以啦。
public class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
LinkedList<Integer> res = new LinkedList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
if(root == null) return res;
stack.push(root);
while(!stack.isEmpty()){
TreeNode node = stack.pop();
res.addFirst(node.val);
if(node.left != null) stack.push(node.left);
if(node.right!= null) stack.push(node.right);
}
return res;
}
}