The adjacency matrix of a given graph is unique.
查看答案
The topological sequence of any directed acyclic graph is unique.
The critical path is the shortest path from the source point to the end point.
There is no node of degree 1 in huffman tree.
In a binary sort tree, new nodes are inserted as always leaf nodes.