Using python list , Queue ADT "enqueue()" is implemented using pop (0 , item)

the string "bla bla bla" is a palindrome word.

Using python list , Queue ADT "size()" is implemented using len (self.item - 1 )

Deque : New items can be added at either the front or the rear.Likewise, existing items can't be removed from either end

add_front(item) adds a new item to the front of the deque. It needs the item and returns item.

size() returns the number of items in the deque. It needs no parameters and returns an integer

add_rear(item) adds a new item to the front of the deque. It needs the item and returns nothing.

remove_front() removes the front item from the deque. It needs parameters and returns the item

remove_rear() removes the rear item from the deque. It needs no parameters and returns the item

Using python list , Deque ADT "add_front()" is implemented using append (item)

Using python list , Deque ADT "add_rear()" is implemented using insert (1,item)

Using python list , Deque ADT "remove_rear()" is implemented using pop ()

Using python list , Deque ADT "remove_front()" is implemented using pop ()

A ........is a string that reads the same forward and backward, for example, radar, toot, and madam

Both array-based sequences and linked lists keep elements in a certain order, but using a very different style.

Lists are ….whereas arrays are …

Each node has at least a single pointer to the next node

The last element points to NULL

connected by pointers and can grow or shrink