Programming Articles - Page 1249 of 3366

When it is required to check if two linked lists are same, a method to add elements to the linked list, and a method to check the equality of the elements in the linked lists are defined.Below is a demonstration for the same −Exampleclass Node:    def __init__(self, data):       self.data = data       self.next = None class LinkedList_structure:    def __init__(self):       self.head = None       self.last_node = None    def add_vals(self, data):       if self.last_node is None:          self.head = Node(data)     ... Read More

When it is required to implement a binary tree data structure using a linked list, a method to set the root node, a method to perform in-order traversal, to insert element to the left of the root node, a method to insert element to the right of the root node, and a method to search the values are defined.Below is a demonstration for the same −Example Live Democlass BinaryTree_structure:    def __init__(self, key=None):       self.key = key       self.left = None       self.right = None    def set_root(self, key):       self.key = ... Read More

When it is required to implement a queue data structure using a linked list, a method to add (enqueue operation) elements to the linked list, and a method to delete (dequeue operation) the elements of the linked list are defined.Below is a demonstration for the same −Example Live Democlass Node:    def __init__(self, data):    self.data = data    self.next = None class Queue_structure:    def __init__(self):       self.head = None       self.last = None    def enqueue_operation(self, data):       if self.last is None:          self.head = Node(data)     ... Read More

When it is required to implement a stack data structure using a linked list, a method to add (push values) elements to the linked list, and a method to delete (pop values) the elements of the linked list are defined.Below is a demonstration for the same −Example Live Democlass Node:    def __init__(self, data):       self.data = data       self.next = None class Stack_structure:    def __init__(self):       self.head = None    def push_val(self, data):       if self.head is None:          self.head = Node(data)       else: ... Read More

When it is required to print the alternate nodes 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 get the alternate values of a linked list 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 print the alternate nodes in a linked list 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 get the alternate values of a linked list are defined. Another helper function is used that calls the previously defined method to get alternate 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 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