描述二叉树(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

传统哈夫曼编码借助树形结构构造，算法实现时使用链表或静态链表结构，空间的每个结点内有左、右子树、双亲指针。

Traditional Huffman coding is structured in the way of tree pattern, using the chain or static chain structure in algorithm, and every node in space has left, right tree and parents Pointers.

youdao

只要鼠标指针在“滚动触发区”（这区域默认是显示面积的右10%）里面，你就能继续自由拖动鼠标指针滚动页面；

Keeping the cursor in the sensitive zone (by default 10% width of the display area on the right) you can scroll freely with only the movement of the cursor;

youdao