树排序是一种原理较复杂的排序方法。
在计算机应用中，要实现树排序编程较难。
On computer's application the programming of tree sort is difficult .
正如我所说，二叉树排序是一种非常有效且快速的方法。
As I said, binary trees are a very efficient and fast way of sorting.
图5展示了一个具有列排序功能的基本树。
排序之前，第4行是展开的，树型网格记住了这个状态。
Before the sorting action, the fourth row is expanded and the tree grid remembered it.
不要对计划发布的工作项树列表进行排序。
Do not sort a tree list of work items that you plan to publish.
不要对计划发布的工作项树列表进行排序。
Do not sort a tree list of work items that you plan to publish.
应用推荐