binary-tree-preorder-traversal java code
来源:互联网 发布:ps软件培训班 编辑:程序博客网 时间:2024/06/03 11:03
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].
Note: Recursive solution is trivial, could you do it iteratively?
Idea: using recursion, backtracking to store the preorder traversal of the tree into the array and return it.
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */import java.util.ArrayList;public class Solution { public ArrayList<Integer> preorderTraversal(TreeNode root) { ArrayList<Integer> list = new ArrayList<Integer>(); if(root == null){ return list; } test(root,list); return list; } public void test(TreeNode node,ArrayList<Integer> list){ list.add(node.val); if(node.left != null){ test(node.left,list); } if(node.right != null){ test(node.right,list); } }}
阅读全文
0 0
- binary-tree-preorder-traversal java code
- construct-binary-tree-from-preorder-and-inorder-traversal Java code
- Binary Tree Preorder Traversal Java
- Binary Tree Preorder Traversal (Java)
- (java)Binary Tree Preorder Traversal
- CODE 141: Binary Tree Preorder Traversal
- [leet code] Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- hdu 3478 Catch(判断奇数环)
- 使用栈进行进制转换
- liunx基本命令(十一)系统日志管理
- hdu5977 Garden of Eden
- 在屏幕上打印杨辉三角
- binary-tree-preorder-traversal java code
- 算法导论第4章习题解析
- 实验三 栈和队列的基本操作实现及其应用
- DockerHub基于Github自动化构建
- 链表学习记录
- LeetCode_697_Degree of an Array
- 循环队列的实现
- Linux下Vue开发环境搭建一篇全搞定
- 数据结构实验之栈与队列四:括号匹配