# Middle-题目8：144. Binary Tree Preorder Traversal

Given a binary tree, return the inorder traversal of its nodes’ values.

public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<Integer>();
traverse(root,result);
return result;
}
public void traverse(TreeNode node,List<Integer> list) {
if(node!=null) {

traverse(node.left,list);
traverse(node.right,list);
}
return;
}
}

1ms,beats 62.04%,众数2ms,58.69%

#### LeetCode(144)Binary Tree Preorder Traversal

2014-01-15 06:29:16

#### LeetCode 144 — Binary Tree Preorder Traversal（C++ Java Python）

2014-03-02 22:13:14

#### 【LeetCode】144 . Binary Tree Preorder Traversal 解题报告

2016-05-22 23:53:41

#### LeetCode144 Binary Tree Preorder Traversal（迭代实现） Java

2016-04-23 13:14:19

#### LeetCode 144 Binary Tree Preorder Traversal（二叉树的前序遍历）+（二叉树、迭代）

2016-03-19 16:15:45

#### leetcode-java-144. Binary Tree Preorder Traversal

2016-06-29 16:46:14

#### Given preorder and inorder traversal of a tree, construct the binary tree.

2014-12-04 23:07:11

#### Construct Binary Tree from Preorder and Inorder Traversal -- LeetCode

2014-04-24 08:43:09

#### 【LeetCode】105. Construct Binary Tree from Preorder and Inorder Traversal 解题报告

2016-06-01 23:42:08

#### LeetCode 105：Construct Binary Tree from Preorder and Inorder Traversal

2015-05-20 23:09:41