Judgment questions

1A data item is the basic unit of data.

2The time complexity of creating an ordered single linked list with n nodes is O(n).

3A recursive algorithm must include a recursive part and a termination condition.

4A common feature of stacks and queues is that elements are only allowed to be inserted

and removed at endpoints.

5Strings can be stored either in sequence or in chain.

6A binary tree can be uniquely identified by its mid-order and post-order sequences.

7A binary tree of depth k has at most 2k-1 nodes.

8A digraph with n vertices has at most n(n+1) edges.

9Binary search has the same time performance as a binary sort tree.

10Quick sort is best used when the data to be sorted is completely out of order.