def difference(self, source): Efficiency: Return a set that contains the items that only exist in self and not in source. Maximum size of target Set is the maximum size of self. Use: target self.difference (source) Parameters: source - a set (Set) Returns: target - a set containing one copy of all the values in self that are not in source (Set) Examples: (1,2,3) difference (3,2,1) is () (1,2,3) difference (4,5,6) is (1,2,3) (1,2,3,4,5,6) difference (0,2,4,6,8) is (1,3,5)
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
![2770
def difference(self, source):
278
279
A280
Efficiency:
281
Return a set that contains the items that only exist in
self and not in source.
282
283
Maximum size of target Set is the maximum size of self.
Use: target = self.difference(source)
284
285
286
287
Parameters:
288
source - a set (Set)
289
Returns:
- a set containing one copy of all the values
target
in self that are not in source (Set)
290
291
292
Examples:
(1,2,3) difference (3,2,1) is ()
(1,2,3) difference (4,5,6) is (1,2,3)
(1,2,3,4,5,6) difference (0,2,4,6,8) is (1,3,5)
293
294
295
296
297
298
299
300
# your code here](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fede118f1-c261-4515-913f-6f02117666f1%2F746577ee-bdc3-4f01-affe-a580fe5a06a0%2F9rdh08h_processed.jpeg&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)