今天开始刷二叉树的题,先了解下二叉树的基本知识:
- 先序遍历: FBADCEFGIH
利用递归实现先序遍历:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
preorderTraversalSub(root,list);
return list;
}
public void preorderTraversalSub(TreeNode root,List<Integer> list){
if(root!=null){
list.add(root.val);
preorderTraversalSub(root.left,list);
preorderTraversalSub(root.right,list);
}
}
}
- 中序遍历: ABCDEFGHI
类似
- 后序遍历: ACEDBHIGF
类似