/**
* 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 res = new ArrayList<>();
Stack<TreeNode> stack = new Stack<TreeNode>();
while(root != null || !stack.isEmpty() ){
while(root != null){
stack.push(root);
root = root.left;
}
root = (stack.pop());
res.add(root.val);
root = root.right;
}
return res;
}
}
非递归实现二叉树的中序遍历
最新推荐文章于 2022-04-26 23:12:27 发布