Answer:
Finding kth element is more efficient in a doubly-linked list when compared to a singly-linked list
Explanation:
Assuming that both lists have firs_t and last_ pointers.
For a singly-linked list ; when locating a kth element, you have iterate through a number of k-1 elements which means that locating an element will be done only in one ( 1 ) direction
For a Doubly-linked list : To locate the Kth element can be done from two ( directions ) i.e. if the Kth element can found either by traversing the number of elements before it or after it . This makes finding the Kth element faster because the shortest route can be taken.
<em>Finding kth element is more efficient in a doubly-linked list when compared to a singly-linked list </em>
Answer:
word = input()
if word > "apple" and word < "pear":
print("Word is valid.")
else:
print("Word is out of range.")
Answer: New Entry
Explanation:
Upon clicking the new entry button given at the bottom we are able to add another recipient in the New Address List dialog box.
The new entry button clears the text fields to enter new details
