definition of binary tree

例句：

1. 1. A binary tree isa type of tree in which each nodehas at most two children.
   二叉树是一种树，其中每个节点最多有两个子节点。
2. 2. In a binary search tree, theleft child is always less than or equalto the parent and the right child isalways greater than the parent.
   在二叉搜索树中，左孩子总是小于或等于父节点，右孩子总是大于父节点。
3. 3. The binary search tree algorithm isused to find the minimum element in anarray.
   二进制搜索树算法用于查找数组中的最小元素。