Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,3,2]
.
Note: Recursive solution is trivial, could you do it iteratively?
思路:遍历二叉树,可以使用递归遍历、使用栈模拟递归迭代遍历、使用线索二叉树的Morris遍历。我选择第三种。Morris遍历参考:Morris,AnnieKim的答案,讲解的很清楚。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
//使用线索二叉树,Morris遍历
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
if(root==null) return res;
TreeNode n = root;
TreeNode pre = null;
while(n!=null){
if(n.left==null){//当前节点的左节点为空,则打印当前节点,并设置当前节点为当前节点的右节点
res.add(n.val);
n = n.right;
}else{//否则,找到当前节点的中序遍历前驱节点,即当前节点左孩子的最右侧孩子
pre = n.left;
while(pre.right!=null&&pre.right!=n) pre = pre.right;
if(pre.right == null){//如果前驱节点为空,则设置其右节点为当前节点(设置线索),并将当前节点设为当前节点的左孩子
pre.right = n;
n = n.left;
}else{//否则,说明当前节点的左分支已经遍历过,恢复成原样,打印,并设置当前节点为当前节点的右孩子
pre.right = null;
res.add(n.val);
n = n.right;
}
}
}
return res;
}
}