Question: ANSWER MUST BE IN PYTHON ANSWER NEEDED QUICKLY THANKYOU Question #1: Consider following code: class Node: def init__(self, next=none, prev=None, data=None) : self.next = next
ANSWER MUST BE IN PYTHON ANSWER NEEDED QUICKLY THANKYOU
Question #1: Consider following code: class Node: def init__(self, next=none, prev=None, data=None) : self.next = next self.prev = prev self.data = data class DLL: def init__(self): self.head = None def push (self, new_data): new_node = Node (data = new_data) new_node. next = self.head new_node.prev = None if self.head is not None: self.head.prev = new_node self.head = new_node def printDLL (self): temp = self.head while temp !=None: print (temp.data) temp = temp.next Write a function named 'delete DivisibleNodes' which will delete all nodes from the doubly linked list which are divisible by K. Pass Kas an argument to the function. Input: List = 15 16 6 7 17, K = 2 Output: Final List = 15 7 17 Input: List = 5 3 4 2 9, K = 3 Output: Final List = 5 4 2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
