94. 二叉树的中序遍历
给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [1,3,2]
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
迭代算法完成:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
Stack<TreeNode> stk = new Stack<>();//栈:先进后出(用来判定存储左节点,若左节点为空,
//需出栈,stk.pop()为根结点,判定右节点是否为空)
while( root !=null || !stk.isEmpty()){//栈不空不要结束
while(root!=null){//左节点为空时退出
stk.push(root);//进栈
root= root.left;//
}
if(!stk.isEmpty()){//栈不为空
root=stk.pop();//出栈
res.add(root.val);
root = root.right;
}
}
return res;
}
}
递归算法简单:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
find(root,res);
return res;
}
public void find (TreeNode root , List<Integer> list) {
if(root==null){
return;
}
find(root.left,list);
list.add(root.val);
find(root.right,list);
}
}