LeetCode 144: Binary Tree Preorder Traversal

来源:互联网 发布:java程序中使用@的注释 编辑:程序博客网 时间:2024/04/30 13:58

Q:
Given a binary tree, return the preorder traversal of its nodes’ values.

前序遍历: 根左右

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    List<Integer> pre = new ArrayList<Integer>();    public List<Integer> preorderTraversal(TreeNode root) {       //为空树则返回     if (root==null)         return pre;         //前序遍历     TreeNode current = root;     //不为空则加入列表     if(current!=null){         pre.add(current.val);         preorderTraversal(current.left);          preorderTraversal(current.right);     }    return pre;    }}
0 0
原创粉丝点击