1. A list is a collection of elements of the same type. 2. In order to maintain and process the list in an array, we need the array holding the list elements, a variable to store the length of the list, and a variable to store the size of the array. Every node in a linked store the address. 3. list has two components: one to store the relevant information and one to ed The algorithms to implement the operations search, insert, and remove are the same for sort and unsorted lists. 4. 5. Operations such as search, insert, and delete require a linked list to be sorted. The usual operations on lists with header and trailer nodes are to initialize the list, destroy the list, print the list, find the length of the list, search the list for a given item, insert an item in the list, delete an item from the list,and copy the list 6. 7. You can use stacks to convert recursive algorithms into nonrecursive algorithms, especially recursive algorithms that are not tail recursive. 8. Functions such as push and pop that are required to implement a stack are not inherently available to C+ programmers. 9. An array is a random access data structure; a stack is not. 10. The bottom element of the stack is the last element added to the stack. 11. To delete a given item from an ordered linked list, there is no need to search the list to see whether the item to be deleted is in the list. 12. A stack is called a LIFO data structure. 13. When an integer is subtracted from a pointer variable, the value of the pointer variable is decremented by the integer times half the size of the memory to which the pointer is pointing. 14. In a linked list implementation of a stack, only a fixed number of elements can be pushed onto the stack. 15. Header and trailer nodes are considered part of a linked list