> For the complete documentation index, see [llms.txt](https://mnunknown.gitbook.io/algorithm-notes/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mnunknown.gitbook.io/algorithm-notes/binary_tree/61_tree_-_ge_zhong_binary_tree_ding_yi.md).

# 各种 Binary Tree 定义

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

![](/files/-MUt7_r98SbciqVt7R3B)

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

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

![](/files/-MUt7_rAJkb1zD08Nynv)

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