当前位置：首页
> Luz 第6659页
Luz 管理员
暂无介绍
89859 篇文章 33 次评论If a graph is represented by an adjacency matrix, then the space
If a graph is represented by an adjacency matrix, then the space taken depends only on the number of vertices, not the n…
If a graph is represented by adjacency lists, then the space tak
If a graph is represented by adjacency lists, then the space taken depends only on the number of vertices, not the numbe…
In a connected graph, there exists at least one vertex of which
In a connected graph, there exists at least one vertex of which the degree is 1. ~@[](1)答案：FALSE…
In a connected graph, the number of edges must be greater than t
In a connected graph, the number of edges must be greater than the number of vertices minus 1. ~@[](1)答案：FALSE…
If the preorder and inorder traversal sequences of a binary tree
If the preorder and inorder traversal sequences of a binary tree are the same, then none of the nodes in the tree has a…
In a directed graph, the sum of the in-degrees and out-degrees o
In a directed graph, the sum of the in-degrees and out-degrees of all the vertices is twice the total number of edges. ~…
In a binary search tree which contains several integer keys incl
In a binary search tree which contains several integer keys including 4, 5, and 6, if 4 and 6 are on the same level, the…
If the postorder and inorder traversal sequences of a binary tre
If the postorder and inorder traversal sequences of a binary tree are the same, then none of the nodes in the tree has a…
If the preorder traversal sequence of a binary tree is `ABC`, th
If the preorder traversal sequence of a binary tree is `ABC`, then `CAB` cannot be its inorder traversal sequence. ~@[](…
If the preorder and inorder traversal sequences of a binary tree
If the preorder and inorder traversal sequences of a binary tree are the same, then none of the nodes in the tree has a…