Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
When it is required to count the number of occurrences of a specific element in a linked list without using recursion, a method to add elements to the linked list, a method to display the elements of the linked list, and a method to count the occurrences of a value are defined.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data self.next = None class my_linked_list: def __init__(self): self.head = None self.last_node = None def add_value(self, my_data): ... Read More
When it is required to count the number of occurrence of a specific element of a linked list with the help of recursion, a method to add elements to the linked list, a method to print the elements of the linked list, and a method to count the occurrence of an element in the linked list is defined. A helper function is defined, since recursion is being used. This helper function calls the previously defined occurrence counting function.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data ... Read More
When it is required to find the length of a linked list without using recursion, a method to add elements to the linked list, and a method to calculate the length of the linked list is defined.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data self.next = None class my_linked_list: def __init__(self): self.head = None self.last_node = None def add_value(self, my_data): if self.last_node is None: self.head = Node(my_data) ... Read More
When it is required to find the length of a linked list with the help of recursion, a method to add elements to the linked list, and a method to calculate the length of the linked list is defined. A helper function is defined that is called with the help of the previously defined length calculation method.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data self.next = None class my_linked_list: def __init__(self): self.head = None self.last_node = None ... Read More
When it is required to display the nodes of a linked list in reverse without using the method of recursion, a method to add elements to the linked list, and a method to display the elements in reverse order is defined.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data self.next = None class my_linked_list: def __init__(self): self.head = None self.last_node = None def add_value(self, my_data): if self.last_node is None: ... Read More
When it is required to display the elements/nodes in a linked list, using recursion method, a method to add values to the linked list, and a method to print the elements of a Linked List. It would also have a helper method that uses recursion, i.e calls the helper function again and again to print the values.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data self.next = None class my_linked_list: def __init__(self): self.head = None self.last_node = None ... Read More
When it is required to display the elements/nodes in a linked list in reverse order, using recursion method, a method to add values to the linked list, as well as a method to reverse the elements of a Linked List. It would also have a helper method that uses recursion, i.e calls the helper function again and again to compute values.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data self.next = None class my_linked_list: def __init__(self): self.head = None ... Read More
When it is required to search for an element in a linked list without using recursion method, a method to add values to the linked list, as well as a method to display the elements of a Linked List.It would also have a method that helps find the index of the element that is being searched.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data self.next = None class my_linked_list: def __init__(self): self.head = None self.last_node = None ... Read More
When it is required to create a linked list, and display the elements of this linked list, a method to add values to the linked list, as well as a method to display the elements of a Linked List.Below is a demonstration for the same −Example Live Democlass Node: def __init__(self, data): self.data = data self.next = None class my_linked_list: def __init__(self): self.head = None self.last_node = None def add_value(self, my_data): if self.last_node is None: self.head = ... Read More
When it is required to append the keys and values of a dictionary in order, the ‘list’ method can be used. Along with this, the ‘.keys’ and ‘.values’ method can be used access the specific keys and values of the dictionary.Below is a demonstration of the same −Example Live Demomy_dict = {"January" : 1, "Feb" : 2, "March" : 3, 'April':4, 'May' : 5, 'June' :6} print("The dictionary is : ") print(my_dict) my_result = list(my_dict.keys()) + list(my_dict.values()) print("The ordered key and value are : ") print(my_result)OutputThe dictionary is : {'January': 1, 'Feb': 2, 'March': 3, 'April': 4, 'May': ... Read More