Which of the following is not a red-black tree property?
a. the root is black
b. all leaves are black
c. consecutive red nodes are disallowed
d. every path from a node to an external node must contain the same number of black nodes
e. all of the above are red-black tree properties
B
You might also like to view...
Answer the following statements true (T) or false (F)
1) The selection sort is a simple and efficient algorithm. 2) After the ith iteration of an ascending order selection sort, the smallest i items of the array will be sorted in increasing order in the first i elements of the array. 3) Insertion sort is a simple and inefficient algorithm. 4) At the ith iteration of the insertion sort algorithm, the array will be sorted. 5) The merge sort algorithm sorts an array by splitting it into two equal- sized subarrays, sorting each subarray and merging them in one larger array.
The discipline for a stack is:
a) data first inserted is the data first out. b) for a misbehaving stack, 30 lashes. c) data last inserted is the data first out. d) depends on the application of the stack.
Read-only memory (ROM)is temporary and volatile. RAM is more permanent and non-volatile.
Answer the following statement true (T) or false (F)
The default value for the float property is one.
Answer the following statement true (T) or false (F)