Leetcode94——Binary Tree Inorder Traversal
来源:互联网 发布:lol韩服账号靠谱淘宝店 编辑:程序博客网 时间:2024/05/16 04:43
文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. 问题描述
Given a binary tree, return the inorder traversal of its nodes’ values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,3,2]
.
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> inorderTraversal(TreeNode root) { List<Integer> list = new ArrayList<Integer>(); if(root == null) { return list; } List<Integer> left = inorderTraversal(root.left); List<Integer> right = inorderTraversal(root.right); list.addAll(left); list.add(root.val); list.addAll(right); return list; }}
0 0
- LeetCode94——Binary Tree Inorder Traversal
- LeetCode94——Binary Tree Inorder Traversal
- Leetcode94——Binary Tree Inorder Traversal
- LeetCode94:Binary Tree Inorder Traversal
- [LeetCode94]Binary Tree Inorder Traversal
- leetcode94 Binary Tree Inorder Traversal
- leetcode94. Binary Tree Inorder Traversal
- Leetcode94. Binary Tree Inorder Traversal
- leetcode94. Binary Tree Inorder Traversal
- LeetCode94 Binary Tree Inorder Traversal
- LeetCode94 Binary Tree Inorder Traversal[Java]
- LeetCode94 Binary Tree Inorder Traversal(迭代实现) Java
- LeetCode——Binary Tree Inorder Traversal
- LeetCode——Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- 【剑指offer】递归循环两种方式反转链表
- iOS:GCDAsyncSocket 的二次封装,粘包处理
- 最小生成树模板(Kruskal和prim)
- MyEclipse-2015-Stable-3.0安装卡住、破解后闪退等问题
- L1-019. 谁先倒
- Leetcode94——Binary Tree Inorder Traversal
- UVA 11997 K Smallest Sums
- Jenkins安装与配置
- C#字符串连接的效率问题
- 文章标题
- Centos安装配置nginx+tomcat
- POJ3984
- Leetcode144——Binary Tree Preorder Traversal
- 使用 IDEA 进行开发