Leetcode144——Binary Tree Preorder Traversal
来源:互联网 发布:lol韩服账号靠谱淘宝店 编辑:程序博客网 时间:2024/05/16 09:57
文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. 问题描述
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]
.
2. 求解
这个题就是一个树的先序遍历问题,最简单的方案就是递归的遍历子树,要注意递归退出的条件。
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public List<Integer> preorderTraversal(TreeNode root) { List<Integer> list = new ArrayList<Integer>(); if(root == null) { return list; } list.add(root.val); List<Integer> left = preorderTraversal(root.left); List<Integer> right = preorderTraversal(root.right); list.addAll(left); list.addAll(right); return list; }}
0 0
- Leetcode144——Binary Tree Preorder Traversal
- LeetCode144—Binary Tree Preorder Traversal
- LeetCode144——Binary Tree Preorder Traversal二叉树先序遍历
- LeetCode144 Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal leetcode144
- leetcode144 Binary Tree Preorder Traversal
- LeetCode144:Binary Tree Preorder Traversal
- LeetCode144-Binary-Tree-Preorder-Traversal
- [leetcode144]Binary Tree Preorder Traversal
- leetcode144 Binary Tree Preorder Traversal
- LeetCode144. Binary Tree Preorder Traversal
- leetcode144. Binary Tree Preorder Traversal
- Leetcode144: Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode144 Binary Tree Preorder Traversal(迭代实现) Java
- LeetCode——Binary Tree Preorder Traversal
- LeetCode——Binary Tree Preorder Traversal
- LeetCode——Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal —— Leetcode
- Jenkins安装与配置
- C#字符串连接的效率问题
- 文章标题
- Centos安装配置nginx+tomcat
- POJ3984
- Leetcode144——Binary Tree Preorder Traversal
- 使用 IDEA 进行开发
- L1-021. 重要的话说三遍
- input在标签内设置禁止输入空格
- Android基础夯实--重温动画(一)之Tween Animation
- Python学习之旅之函数
- LeetCode | 530. Minimum Absolute Difference in BST
- 文件排序
- L1-022. 奇偶分家