当前位置：首页
> Luz 第6595页
Luz 管理员
暂无介绍
89859 篇文章 33 次评论如果由结点{ 1, 2, 3, 4 }组成的AVL树的深度是3（根结点的深度是1），则结点2或者结点3一定有两个子结点。
如果由结点{ 1, 2, 3, 4 }组成的AVL树的深度是3（根结点的深度是1），则结点2或者结点3一定有两个子结点。~@[](2)答案：TRUE…
For any node in an AVL tree, the left and right subtrees must ha
For any node in an AVL tree, the left and right subtrees must have the same height. ~@[](1)答案：FALSE…
Given a binary search tree with 20 integer keys which include 10
Given a binary search tree with 20 integer keys which include 10, 11, and 12, if 10 and 12 are on the same level, then 1…
To find 63 from a binary search tree, one possible searching seq
To find 63 from a binary search tree, one possible searching sequence is {39, 101, 25, 80, 70, 59, 63}. ~@[](3)答案：FALSE…
In a binary search tree, the keys on the same level from left to
In a binary search tree, the keys on the same level from left to right must be in sorted (non-decreasing) order. ~@[](2)…
The time complexity of searching in a binary search tree is the
The time complexity of searching in a binary search tree is the same as that of binary search. ~@[](2)答案：FALSE…
在堆排序中，若要进行升序排序，则需要建立大根堆。（ ）
在堆排序中，若要进行升序排序，则需要建立大根堆。（ ） ~@[](1)答案：TRUE…