2. Write a Python program that performs a singly linked-list operation on the following values: 11, 9, 17, 89, 1, 90, 19, 5, 3, 23 The first 2 steps are given below: 1) Start with a single node Make a Node class that holds some data and a single pointer next, that will be used to point to the next Node type object in the Linked List. #A single node of a singly linked list class Node: #constructor def (self,data,next=None): init self.data = data self.next = next %#3 Creating a single node first = Node (3) print (first.data)

please fill in the blanks and complate the code

(a) Explain the advantages of adding a tail pointer to a linked list.(b) Explain the advantages of doubly-linked over singly-linked lists.

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

Java Implement Stack using Deque (doubly linked list) You must create an array and the user can insert elements into this array and can only access or remove the newly inserted element from the array. The array is executed using a doubly linked list. The following Project should have these classes: 1. Class Book: The main Node for the deque array where it should have the following attributes besides (next, prev nodes): a) Book Id b) Book Name c) Book Author 2. Class Booklists: Where all the main operations are done. You need to apply these following operations: 1) AddBook() [push(0) : The method Inserts the book object into deque Stack (form the last). 2) RemoveBook() [pop()] : This method extracts an object from the last of the Deque stack and it removes it. If such object does not exist, the method returns null.(from the last) 3) isEmpty() : Return True if deque stack is Empty else return False. 4) DisplayAlIBooks() : Print all the books in the deque stack. 5) getlistsize(): Return…

C++

Given an IntNode struct and the operating functions for a linked list, complete the following functions to extend the functionality of the linked list(this is not graded).