LeetCode94.二叉树的中序遍历
题目: 给定一个二叉树,返回它的中序 遍历。
1.递归解法
2.非递归解法
public class Solution {
public List < Integer > inorderTraversal(TreeNode root) {
List < Integer > res = new ArrayList < > ();
Stack < TreeNode > stack = new Stack < > ();
TreeNode curr = root;
while (curr != null || !stack.isEmpty()) {
while (curr != null) {
stack.push(curr);
curr = curr.left;
}
curr = stack.pop();
res.add(curr.val);
curr = curr.right;
}
return res;
}
}
复杂度分析
- 时间复杂度:O(n)
- 空间复杂度:O(n)
图片解析
假设此二叉树为[1,2,3,4,5,6].如图所示: