I need help with following: (True or False)

A linked list stores items in an unspecified order.

A node in binary tree can have zero, one, or two children.

A list node's data can store a record with multiple sub items.

Items stored in an array can be accessed using a positional index.

The statement below that assigns x with y is a constant time operation.

y = 10, x = y

A loop is never a constant time operation.

Integers will be placed into buckets based on the 1's digit. More buckets are needed for an array with one thousand integers than for an array with one hundred integers.

Consider integers X and Y, such that X < Y. X will always be in a lower bucket than Y.

All integers from an array could be placed into the same bucket, even if the array has no duplicates.

When sorting an array of n 3-digit integers, RadixSort's worst-case time complexity is O(n).

When sorting an array with n elements, the maximum number of elements that RadixSort may put in a bucket is n.

RadixSort has a space complexity of O(1).

Given a list with items 'Z', 'A', 'B', Sort(list) yields 'A', 'B', 'Z'.

If a list ADT has operations like Sort or PrintReverse, the list is clearly implemented using an array.

ListTraverse can be used to traverse a doubly-linked list.

The length of an array-based list equals the list's array allocation size.

An item can be appended to an array-based list, provided the length is less than the array's allocated size.

Encryption and decryption are synonymous.

Cryptography is used heavily in internet communications.

The Caeser cipher is an encryption algorithm that works well to secure data for modern digital communications.

A file in a file system tree is always a leaf node.

A directory in a file system tree is always an internal node.

Using a tree data structure to implement a file system requires that each directory node support a variable number of children.

BSTInsertwill not work if the tree's root is null.

BSTReplaceChild will not work if the parent pointer is null.

BSTRemoveKey will not work if the key is not in the tree.

BSTRemoveNode will not work to remove the last node in a tree.

BSTRemoveKey uses BSTRemoveNode.

BSTRemoveNode uses BSTRemoveKey.

BSTRemoveNode may use recursion.

BSTRemoveKey will not properly update parent pointers when a non-root node is being removed.

All calls to BSTRemoveNode to remove a non-root node will result in a call to BSTReplaceChild.

The longer a street is, the more vertices will be needed to represent that street.

Using the physical distance between vertices as edge weights will often suffice in contexts where the fastest route needs to be found.

Navigation software would have no need to place a vertex on a road in a location where the road does not intersect any other roads.

If navigation software uses GPS to automatically determine the start location for a route, the vertex closest to the GPS coordinates can be used as the starting vertex.

Suppose a graph is used to represent airline flights. Vertices represent airports and edge weights represent flight durations. Edges in the graph could potentially be added or removed during a single day's worth of flights.

A greedy algorithm always finds an optimal solution.