描述二叉树(binary tree)的节点有一个数据值、一个左指针和一个右指针；不过，很多数据体要求树不只有一个左分支和一个右分支。

Binary trees are represented by nodes that have a data value and a left and right pointer; however, there are many data structures that require trees with more than just a left and right branch.

youdao

之间的差异的时间间隔段树，是什么树，二叉树和范围的树木？

What are the differences between segment trees, interval trees, binary indexed trees and range trees?

youdao

利用DNA分子和连接酶的生物特性，提出DNA计算机中二叉树的链式存储结构的设计方法，并给出二叉树链式存储结构的形式描述。

This paper proposed the method of designing linked storage structure of the binary tree in DNA computer, which utilized the biological characteristics of DNA molecules and ligases.

youdao