Binary Tree Preorder Traversal
题意:给一个树,求前序序列解法:……直接上代码吧
public class Solution {
List<Integer> list;
public List<Integer> preorderTraversal(TreeNode root) {
list = new LinkedList<Integer>();
dfs(root);
return list;
}
public void dfs(TreeNode r) {
if (r == null)
return;
list.add(r.val);
dfs(r.left);
dfs(r.right);
}
}
Binary Tree Postorder Traversal
题意:给一个数,求后序序列解法…………不知道为什么给了hard?
public class Solution {
List<Integer> list;
public List<Integer> postorderTraversal(TreeNode root) {
list = new LinkedList<Integer>();
dfs(root);
return list;
}
public void dfs(TreeNode r) {
if (r == null)
return;
dfs(r.left);
dfs(r.right);
list.add(r.val);
}
}