当前位置：首页
> Luz 第6647页
Luz 管理员
暂无介绍
89859 篇文章 33 次评论If the inorder and the preorder traversal sequences of a binary
If the inorder and the preorder traversal sequences of a binary tree have exactly the same order, then none of the nodes…
If the inorder and the postorder traversal sequences of a binary
If the inorder and the postorder traversal sequences of a binary tree have exactly the same order, then none of the node…
If the preorder and the postorder traversal sequences of a binar
If the preorder and the postorder traversal sequences of a binary tree have exactly the opposite orders, then none of th…
用3条磁带对55个有序段做2路归并，初始的段分配成（34，21）比分配成（30，25）要好。
用3条磁带对55个有序段做2路归并，初始的段分配成（34，21）比分配成（30，25）要好。~@[](2)答案：TRUE…
For a $$k$$-way merge we need at least $$2k$$ input buffers and
For a $$k$$-way merge we need at least $$2k$$ input buffers and $$k$$ output buffers for parallel operations. ~@[](1)答案：…
在外部排序中，$$k$$路归并被用于减少归并的趟数。只要有足够多的磁带，$$k$$越大越好。
在外部排序中，$$k$$路归并被用于减少归并的趟数。只要有足够多的磁带，$$k$$越大越好。~@[](2)答案：FALSE…
Let P be the shortest path from S to T. If the weight of every
Let P be the shortest path from S to T. If the weight of every edge in the graph is incremented by 1, P will still be t…
Let M be the minimum spanning tree of a weighted graph G. Then
Let M be the minimum spanning tree of a weighted graph G. Then the path in M between V1 and V2 must be the shortest pat…