[LeetCode]Binary Tree Inorder Traversal
来源:互联网 发布:淘宝客服话术培训 编辑:程序博客网 时间:2024/06/06 09:04
题目描述
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,3,2]
.
解题思路
递归:
- 中序遍历左子树;
- 访问根节点;
- 中序遍历右子树;
代码
/** * 中序遍历二叉树 * @param root * @return */public static List<Integer> inorderTraversal(TreeNode root) {List<Integer> list = new ArrayList<Integer>();if(root==null)return list;//中序遍历左子树;if(root.left!=null){list.addAll(0, inorderTraversal(root.left));}//访问根节点;list.add(root.val);//中序遍历右子树;if(root.right!=null){list.addAll(inorderTraversal(root.right));}return list;}
0 0
- LeetCode: Binary Tree Inorder Traversal
- [LeetCode]Binary Tree Inorder Traversal
- LeetCode Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Inorder Traversal
- Leetcode: Binary Tree Inorder Traversal
- LeetCode Binary Tree Inorder Traversal
- LeetCode : Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Inorder Traversal
- 【leetcode】Binary Tree Inorder Traversal
- [LeetCode]Binary Tree Inorder Traversal
- Leetcode: Binary Tree Inorder Traversal
- [leetcode]Binary Tree Inorder Traversal
- LeetCode-Binary Tree Inorder Traversal
- Leetcode Binary Tree Inorder Traversal
- [leetcode] Binary Tree Inorder Traversal
- LeetCode - Binary Tree Inorder Traversal
- [LeetCode] Binary Tree Inorder Traversal
- LeetCode | Binary Tree Inorder Traversal
- 轻松解决PHP中文编码苦恼的小技巧
- 内存分配——静态存储区 栈 堆
- hibernate 数据行数统计 count(*)
- ffmpeg开发指南(使用 libavformat 和 libavcodec)
- JVM参数详解与配置
- [LeetCode]Binary Tree Inorder Traversal
- 让AMD在中国发声 APU14技术创新大会首次在华召开
- 国嵌语言的艺术之C++项目讲解精讲班(27课全)
- Hibernate or 的用法
- BIS开发手册
- Oracle开发专题之:%TYPE 和 %ROWTYPE
- 关于离线查询
- Eclipse中给jar包导入JavaDoc注释文档的方法
- 知乎网址