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

Luz 管理员

暂无介绍

89860 篇文章 33 次评论

Some Java objects are put in the heap, while some are in stack.

Luz5年前 (2021-05-10)1724
Some Java objects are put in the heap, while some are in stack. ~@[](1)答案:FALSE…

the average time complexity of the travesal of a binary tree wi

Luz5年前 (2021-05-10)902
the average time complexity of the travesal of a binary tree with n nodes is O(logn). ~@[](2)答案:TRUE…

It is always possible to represent a tree by a one-dimensional i

Luz5年前 (2021-05-10)1889
It is always possible to represent a tree by a one-dimensional integer array. ~@[](1)答案:TRUE…

The number of leaf nodes in a binary tree is only related to the

Luz5年前 (2021-05-10)1292
The number of leaf nodes in a binary tree is only related to the number of 2-degree nodes , i.e it has nothing to do wit…

Java中数组的元素只能是简单数据类型。

Luz5年前 (2021-05-10)1726
Java中数组的元素只能是简单数据类型。 ~@[](1)答案:FALSE…

the average time complexity of the travesal of a binary tree wi

Luz5年前 (2021-05-10)913
the average time complexity of the travesal of a binary tree with n nodes is O(n). ~@[](2)答案:FALSE…

在二叉树的顺序存储结构中(根的下标为1),下标为130的结点一定处于左子树中。

Luz5年前 (2021-05-10)2006
在二叉树的顺序存储结构中(根的下标为1),下标为130的结点一定处于左子树中。 ~@[](1)答案:TRUE…

There exists a binary tree with 2016 nodes in total, and with 16

Luz5年前 (2021-05-10)1428
There exists a binary tree with 2016 nodes in total, and with 16 nodes having only one child. ~@[](3)答案:FALSE…

采用深度优先搜索或拓扑排序算法可以判断一个有向图中是否有环。

Luz5年前 (2021-05-10)925
采用深度优先搜索或拓扑排序算法可以判断一个有向图中是否有环。 ~@[](1)答案:TRUE…

采用邻接表存储的图,其广度优先遍历类似于二叉树的先序遍历。

Luz5年前 (2021-05-10)1019
采用邻接表存储的图,其广度优先遍历类似于二叉树的先序遍历。 ~@[](1)答案:FALSE…