# 各种 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.


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://mnunknown.gitbook.io/algorithm-notes/binary_tree/61_tree_-_ge_zhong_binary_tree_ding_yi.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.