-->
当前位置:首页 > Luz 第6054页
Luz

Luz 管理员

暂无介绍

89860 篇文章 33 次评论

单选题:Given a tree of degree 6. Suppose that the numbers of nodes of d

Luz5年前 (2021-05-10)851
Given a tree of degree 6. Suppose that the numbers of nodes of degrees 1, 2, 3, 4, 5, 6 are 3, 5, 2, 3, 1, 2, respective…

单选题:Rehashing is required when an insertion to a hash table fails.

Luz5年前 (2021-05-10)2029
Rehashing is required when an insertion to a hash table fails. Which of the following is **NOT** necessary to rehashing…

单选题:For an in-order threaded binary tree, if the pre-order and in-or

Luz5年前 (2021-05-10)763
For an in-order threaded binary tree, if the pre-order and in-order traversal sequences are `B E A C F D` and `A E C B D…

单选题:Given a tree of degree 6. Suppose that the numbers of nodes of d

Luz5年前 (2021-05-10)593
Given a tree of degree 6. Suppose that the numbers of nodes of degrees 1, 2, 3, 4, 5, 6 are 5, 3, 2, 3, 2, 1, respective…

单选题:For an in-order threaded binary tree, if the pre-order and in-or

Luz5年前 (2021-05-10)1048
For an in-order threaded binary tree, if the pre-order and in-order traversal sequences are `B E A C F D` and `A E C B D…

单选题:In a disjoint set problem, given a set of $$m$$ elements $$S$$ =

Luz5年前 (2021-05-10)826
In a disjoint set problem, given a set of $$m$$ elements $$S$$ = { 1, 2, 3, ..., $$m$$ } and $$n$$ ( $$ 0˂n˂m$$ ) distin…

单选题:If the hash values of $$n$$ keys are all the same, and linear pr

Luz5年前 (2021-05-10)767
If the hash values of $$n$$ keys are all the same, and linear probing is used to resolve collisions, then the minimum t…

单选题:若栈$$S_1$$中保存整数,栈$$S_2$$中保存运算符,函数`F()`依次执行下述各步操作:

Luz5年前 (2021-05-10)1791
若栈$$S_1$$中保存整数,栈$$S_2$$中保存运算符,函数`F()`依次执行下述各步操作:- (1)从$$S_1$$中依次弹出两个操作数`a`和`b`;- (2)从$$S_2$$中弹出一个运算符`op`;- (3)执行相应的运算`b…

单选题:现有队列 Q 与栈 S,初始时 Q 中的元素依次是{ 1, 2, 3, 4, 5, 6 }(1在队头),S 为空。若允许下列3种

Luz5年前 (2021-05-10)4582
现有队列 Q 与栈 S,初始时 Q 中的元素依次是{ 1, 2, 3, 4, 5, 6 }(1在队头),S 为空。若允许下列3种操作:(1)出队并输出出队元素;(2)出队并将出队元素入栈;(3)出栈并输出出栈元素,则不能得到的输出序列是:@…

单选题:设一棵非空完全二叉树 $$T$$ 的所有叶节点均位于同一层,且每个非叶结点都有 2 个子结点。若 $$T$$ 有 $$k$$ 个

Luz5年前 (2021-05-10)1973
设一棵非空完全二叉树 $$T$$ 的所有叶节点均位于同一层,且每个非叶结点都有 2 个子结点。若 $$T$$ 有 $$k$$ 个叶结点,则 $$T$$ 的结点总数是:@[A](2)A. $$2k-1$$B. $$2k$$C. $$k^2$$…