(java)Binary Tree Preorder Traversal
来源:互联网 发布:记账app 知乎 编辑:程序博客网 时间:2024/06/05 18:17
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,2,3]
.
Note: Recursive solution is trivial, could you do it iteratively?
思路:就是一个先序遍历
代码如下(已通过leetcode)
public class Solution {
List<Integer> list=new ArrayList<Integer>();
public List<Integer> preorderTraversal(TreeNode root) {
if(root==null) return list;
list.add(root.val);
if(root.left!=null) preorderTraversal(root.left);
if(root.right!=null) preorderTraversal(root.right);
return list;
}
}
0 0
- Binary Tree Preorder Traversal Java
- Binary Tree Preorder Traversal (Java)
- (java)Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- 常用的数据结构
- 用队列写贪吃蛇(C语言版)
- 程序员的故事 008 编程语言之争
- MFC双缓冲绘图
- linux redis安装
- (java)Binary Tree Preorder Traversal
- Nginx运行和控制命令
- ***LeetCode 90 Subsets ii
- php性能优化学习记录一
- 面试
- 关于React使用中遇到的坑
- 个人进阶之路——安卓蓝牙模块(4)
- H-Index II
- unity——角色控制以及网络组件