The concept of in-place quicksort binary tree has great theoretical and practical reference value to the research and improvement of sorting algorithm.

原地快速排序二叉树的概念对排序算法的研究和改进具有很好的理论和实用参考价值。

In the architecture， multi-function proc essing elements are arranged on the lowest layer of the binary tree and the adde r tree can be split into two sub-trees.

包括运动矢量优化（搜索）在内的多任务是通过二叉树最底层叶节点上的多功能处理单元和可以拆分成子树的加法树来实现的。