# 各种 Binary Tree 定义

## 参考 wikipedia [各类二叉树的定义](https://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees)

![](https://2030049235-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-MUt7Y8-dUQcwNZkL6dz%2Fsync%2F1f0259713c523c0c4e7e164532e379d964bcebd3.jpg?generation=1614792527566921\&alt=media)

## 每个节点 children = 0 / 2，为 full binary tree

## 简单讲就是没有奇葩的单节点“拐弯”。

![](https://2030049235-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-MUt7Y8-dUQcwNZkL6dz%2Fsync%2F77335245d9965cdf52df0c2a3b1f520942a59ac0.jpg?generation=1614792527444992\&alt=media)

## 按 level order 从左到右依次（尽量）填满，为 complete binary tree.