# 【算法导论】决策树是满二叉树吗？

“A decision tree is a full binary tree…”一个决策树是满二叉树！

• full binary tree or proper binary tree [17] (sometimes 2-tree or strictly binary tree) is a tree in which every node other than the leaves has two children. Physicists define a binary tree to mean a full binary tree.[18]  An  ancestry chart which maps to a perfect depth-4 binary tree . A full tree is sometimes ambiguously defined as a perfect tree (see next).
• perfect binary tree is a full binary tree in which all leaves have the same depth or same level, and in which every parent has two children.[19] (This is ambiguously also called a complete binary tree (see next).) An example of a perfect binary tree is the ancestry chart of a person to a given depth, as each person has exactly two biological parents (one mother and one father); note that this reverses the usual parent/child tree convention, and these trees go in the opposite direction from usual (root at bottom).

原文作者：满二叉树
原文地址: https://blog.csdn.net/cjmcp/article/details/38534133
本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系博主进行删除。