代码如下。前序遍历思路简单粗暴,根元素入栈,根元素出栈。然后右节点入栈,左节点入栈。直到栈为空退出循环。
package 二叉树的前序遍历;
import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
import 二叉树的前序遍历.TreeNode;
public class Solution {
public static void main(String[] args) {
// TODO 自动生成的方法存根
TreeNode root = new TreeNode(1);
root.right = new TreeNode(2);
root.right.left = new TreeNode(3);
System.out.println(preorderTraversal(root));
}
static List<Integer> preorderTraversal(TreeNode root) {
if (root == null) {
return new ArrayList<Integer>();
}
List<Integer> list = new ArrayList<Integer>();
Stack<TreeNode> s = new Stack<TreeNode>();
TreeNode currentNode = null;
s.push(root);
while(!s.isEmpty()) {
currentNode = s.pop();
list.add(currentNode.val);
if(currentNode.right != null)
s.push(currentNode.right);
if(currentNode.left != null)
s.push(currentNode.left);
}
return list;
}
}