二叉树理论基础
专业名词
度:每个子节点的数量(最多2)
树高:总层数
根节点:最顶上的
左子树、右子树。左节点、右节点。
种类
满二叉树:全满
完全二叉树:除了底层全满,底层要从左到右连续
二叉搜索树:左边的所有节点都小于中间节点
平衡二叉搜索树:左子树和右子树相差不能大于1
遍历
1.深度优先搜索
一条道走到黑(竖着走)
方法:栈/递归(递归法、迭代法)
顺序
描述【中】所在的位置
1.前序:中左右
2.中序:左中右
3.后序:左右中
2.广度优先搜索
按层遍历(横着走)/或一圈一圈遍历
方法:队列
二叉树实现代码
public class TreeNode{
int val;//存储数值
TreeNode leftNode;
TreeNode rightNode;
//构造方法
public TreeNode(){}
public TreeNode(int val){
this.val=val;
}
public TreeNode(int val,TreeNode leftNode,TreeNode rightNode){
this.val=val;
this.leftNode=leftNode;
this.rightNode=rightNode;
}
}
二叉树的递归遍历
递归三要素
1.确定递归的参数返回值
2.确定终止条件
3.确定单层递归逻辑
前序代码
/**
* 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 res){
if(root==null){return;}
res.add(root.val);
preorder(root.left,res);
preorder(root.right,res);
}
}
后序
/**
* 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> postorderTraversal(TreeNode root) {
List<Integer>res=new ArrayList<>();
postorder(root,res);
return res;
}
public void postorder(TreeNode root,List res){
if(root==null)return;
postorder(root.left,res);
postorder(root.right,res);
res.add(root.val);
}
}
中序
/**
* 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> inorderTraversal(TreeNode root) {
List<Integer> res=new ArrayList<>();
inorder(root,res);
return res;
}
public void inorder(TreeNode root,List res){
if(root==null)return;
inorder(root.left,res);
res.add(root.val);
inorder(root.right,res);
}
}
总结
学习了两个小时,初步了解了二叉树的基础知识和遍历操作。