[Leetcode] Binary Tree Inorder Traversal (Java)

来源：互联网发布：微信刷票软件免费版编辑：程序博客网时间：2024/06/05 19:33

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].

Note: Recursive solution is trivial, could you do it iteratively?

中序遍历，递归很简单

public class Solution {        public ArrayList<Integer> inorderTraversal(TreeNode root) {ArrayList<Integer> res = new ArrayList<Integer>();if(root!=null)inorder(res,root);return res;}private void inorder(ArrayList<Integer> res, TreeNode root) {if(root.left!=null)inorder(res, root.left);res.add(root.val);if(root.right!=null)inorder(res, root.right);}}

0 0

[Leetcode] Binary Tree Inorder Traversal (Java)
Binary Tree Inorder Traversal LeetCode Java
【Leetcode】Binary Tree Inorder Traversal in JAVA
[LeetCode][Java] Binary Tree Inorder Traversal
leetcode-94:Binary Tree Inorder Traversal (Java)
leetcode：Binary Tree Inorder Traversal 【Java】
LeetCode 94 -Binary Tree Inorder Traversal ( JAVA )
leetcode-java-94. Binary Tree Inorder Traversal
【leetcode】94. Binary Tree Inorder Traversal【java】
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
C/C++ 语言中的表达式求值
无需重编修改程序的静态变量初始值
72 Android WebView AlertDialog
基于visual Studio2013解决算法导论之020单链表
EDA技术课后题答案
[Leetcode] Binary Tree Inorder Traversal (Java)
oracle教程之oracle10g 手动创建数据详解（linux）
PHP上台阶问题（斐波纳契数列应用）
gtest and make file reference
netbeans 查找替换整个项目
安卓按home键之后，再次点击程序图标避免再次重新启动程序解决办法
QTableWidget之表头塌陷、光标移动
SQLite 入门教程（四）增删改查
集成 Tomcat 插件到 Eclipse 的过程