树的相关定义:
- 结点:树里的元素
- 父子关系:节点之间相连的边
- 子树:结点大于1时,其余的结点分为互不相交的集合
- 度:子节点的数量
- 叶子:度为0的结点
- 孩子:结点的子树的根
二叉树:
一种特殊的数据结构,每个结点至多只有两个子树;
二叉树的第N层至多有个结点,树至多有个结点。
满二叉树:
每个存在子结点的结点都有两个子结点
完全二叉树:
除了最后一层外,其他层的结点树达到最大,且最后一层结点都连续靠左排列
二叉树的层次遍历
按照下图所示顺序遍历显示二叉树的所有元素,打印顺序应该为ABECFDGHK
遍历代码如下:
public class BinaryTree {
@Data
private static class TreeNode<T>{
private T data;
private TreeNode<T> left;
private TreeNode<T> right;
public TreeNode(T data, TreeNode<T> left, TreeNode<T> right) {
this.data = data;
this.left = left;
this.right = right;
}
}
private static void print(TreeNode node) {
System.out.print(node.getData());
}
public static void hierarchic(TreeNode root) {
LinkedList<TreeNode> queue = new LinkedList<>();
queue.push(root);
while (!queue.isEmpty()) {
TreeNode treeNode = queue.poll();
print(treeNode);
if (treeNode.getLeft() != null) {
queue.offer(treeNode.getLeft());
}
if (treeNode.getRight() != null) {
queue.offer(treeNode.getRight());
}
}
}
public static void main(String[] args) {
TreeNode<String> D = new TreeNode<>("D", null, null);
TreeNode<String> C = new TreeNode<>("C", D, null);
TreeNode<String> B = new TreeNode<>("B", null, C);
TreeNode<String> H = new TreeNode<>("H", null, null);
TreeNode<String> K = new TreeNode<>("K", null, null);
TreeNode<String> G = new TreeNode<>("G", H, K);
TreeNode<String> F = new TreeNode<>("F", null, G);
TreeNode<String> E = new TreeNode<>("E", F, null);
TreeNode<String> A = new TreeNode<>("A", B, E);
hierarchic(A);
}
}