题目
Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes’ values.
For example:
Given binary tree {1,#,2,3},
1
\
2
/
3
return [1,3,2].
思路
二叉树的中序遍历,递归和非递归两种。
有一个不用栈的非递归的方法,空间复杂度O(1),可参考:《Morris Traversal方法遍历二叉树(非递归,不用栈,O(1)空间)》
递归解法
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new LinkedList<Integer>();
if (root != null) {
list.addAll(inorderTraversal(root.left));
list.add(root.val);
list.addAll(inorderTraversal(root.right));
}
return list;
}
非递归解法
我的解法
public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new LinkedList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode node = root;
if (root != null)
stack.push(node);
while (!stack.empty()) {
//node = node.left;
if (node.left != null) {//左孩子不空,入栈
node = node.left;
stack.push(node);
}
else {//说明左孩子为空,该结点出栈
stack.pop();
list.add(node.val);
while (node.right == null && !stack.empty()) {
//else if (!stack.empty()){//没有右孩子,则判断父结点是否有右孩子
node = stack.pop();
list.add(node.val);
}
if (node.right != null) {//该结点有右孩子,入栈
node = node.right;
stack.push(node);
}
}
}
return list;
}
}
优化方法
public cblass Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new LinkedList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode node = root;//可以认为,node一直指向“根节点”
while (node != null || !stack.empty()) {
while (node != null) {//一直遍历到最左结点
stack.push(node);//将“根节点入栈”
node = node.left;
}
node = stack.pop();//没有左孩子,根结点出栈,准备遍历右孩子
list.add(node.val);
node = node.right;
}
return list;
}
}