一、描述:
二、思路:
二叉树先序遍历:1访问根结点;2访问左子树;3访问右子树;如:
递归实现,结点为空时递归结束
三、代码:
1 /** 2 * Definition for a binary tree node. 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */ 10 11 import java.util.*; 12 public class Solution { 13 List<Integer> list = new ArrayList<Integer>(); 14 public List<Integer> preorderTraversal(TreeNode root) { 15 if(root==null){ 16 return list; 17 } 18 list.add(root.val); 19 preorderTraversal(root.left); 20 preorderTraversal(root.right); 21 return list; 22 }