• 1. 二元树: full binary tree
• 2. 引线二元树: tree thread binary
• 3. 完整二元树: complete binary tree

更多释义

• 1.考虑以下的int二元树的类层次结构。
  Consider the following class hierarchy for binary trees of ints.
  dict.yoduao.com
• 2.清单1 . int二元树的类层次结构。
  Listing 1. Class hierarchy for binary trees of ints.
  dict.yoduao.com
• 3.并利用其曲率函数的零交叉指纹图的交汇点建立相应的二元树。
  Then it makes use of the crossing points of the zero-crossing fingerprint graph of the curvature to establish the corresponding binary tree.
  dict.yoduao.com

©2026 网易公司