/**
* 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> preorderTraversal(TreeNode root) {
Stack<TreeNode> stack=new Stack<TreeNode>();
List<Integer> list=new ArrayList<Integer>();
TreeNode r=root;
while(r!=null||!stack.isEmpty()){
if(r==null){
r=stack.pop();
}
if(r.right!=null){
stack.push(r.right);
}
list.add(r.val);
r=r.left;
}
return list;
}
}
算法系列------二叉树的前序遍历
最新推荐文章于 2023-08-03 20:52:20 发布