首页 > 代码库 > [LeetCode#]Binary Tree Inorder Traversal
[LeetCode#]Binary Tree Inorder Traversal
The problem:
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?
The recursion way is very trivial:
public class Solution { public List<Integer> inorderTraversal(TreeNode root) { ArrayList<Integer> ret = new ArrayList<Integer> (); if (root == null) return ret; helper(root, ret); return ret; } private void helper(TreeNode cur_root, ArrayList<Integer> ret) { if (cur_root == null) return; helper(cur_root.left, ret); ret.add(cur_root.val); helper(cur_root.right, ret); }}
[LeetCode#]Binary Tree Inorder Traversal
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。