前序遍历
思路
首先将头结点保存进栈里,接下来用while循环将栈里的元素保存到res集合里再删除,接着判断是否有右节点和左节点有就存。要先存右结点,虽然前序遍历是中左右,但是由于出栈顺序相反所以保存也得相反。
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer>res=new ArrayList<>();
if(root==null)return res;
Stack<TreeNode> stack=new Stack();//栈
stack.push(root);
while(!stack.isEmpty()){
TreeNode node=stack.pop();
res.add(node.val);
if(node.right!=null){
stack.push(node.right);
}
if(node.left!=null){
stack.push(node.left);
}
}
return res;
}
}
后序遍历改一下顺序就行
中序遍历
思路
首先将根节点存为指针cur,因为第一个操作的对象不是根节点,当指针不是空就将元素存进栈里接着挪动指针,是就把指针挪回中间节点,存到res里,然后往右挪。
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> res=new ArrayList<>();
if(root==null)return res;
Stack<TreeNode> s=new Stack<>();
TreeNode cur=root;
while(cur!=null||!s.isEmpty()){
if(cur!=null){
s.push(cur);
cur=cur.left;
}else{
cur=s.pop();
res.add(cur.val);
cur=cur.right;
}
}
return res;
}
}