目录
二叉树的递归遍历(前中后)递归的要素:确定终止条件,参数有哪些,返回值有哪些,单层的处理逻辑怎么写?
二叉树的定义代码(java 版本)
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; } }
二叉树的递归遍历(前中后)递归的要素:确定终止条件,参数有哪些,返回值有哪些,单层的处理逻辑怎么写?
前序遍历
/** * 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> res=new ArrayList<>(); //递归的函数 preorder(root,res); //返回结果 return res; } public void preorder(TreeNode root,List<Integer> res){ if(root==null) return; res.add(root.val); preorder(root.left,res); preorder(root.right,res); } }
中序遍历
class Solution { public List<Integer> inorderTraversal(TreeNode root) { List<Integer> res=new ArrayList<>(); inorder(root,res); return res; } public void inorder(TreeNode root , List<Integer> res){ if(root==null) return;//终止条件 inorder(root.left,res); res.add(root.val); inorder(root.right,res); } }
后序遍历
class Solution { public List<Integer> postorderTraversal(TreeNode root) { List<Integer> res=new ArrayList<>(); postorder(root,res); return res; } public void postorder(TreeNode root , List<Integer> res){ if(root==null) return;//终止条件 postorder(root.left,res); postorder(root.right,res); res.add(root.val); } }