Question 1 Continues
*** This is the NODE ADT you need. I hope this will help to solve question 1.
3) node.py :-
# CMPT 145: Node-based structures
# Defines the Node ADT
#
# A node is a simple container with two pieces of information
# data: the contained information
# next: a reference to another node
# We can create node-chains of any size.
# Implementation notes:
# - uses a Python dictionary as a record.
# - causes Assertion error if get/set called with
node=None
def create(data, next=None):
"""
Create a new node for the given data.
Pre-conditions:
data: Any data
value to be stored in the node
next: Another node
(or None, by default)
Post-condition:
none
Return:
the node
created
"""
return {'data':data, 'next':next}
def get_data(node):
"""
Retrieve the contents of the data
field.
Pre-conditions:
node: a node
created by create()
Post-conditions:
none
Return
the data value
stored previously in the node
"""
assert node is not None, "get_data() called
with argument None"
return node['data']
def get_next(node):
"""
Retrieve the contents of the next
field.
Pre-conditions:
node: a node
created by create()
Post-conditions:
none
Return
the value stored
previously in the next field
"""
assert node is not None, "get_next() called
with argument None"
return node['next']
def set_data(node, val):
"""
Set the contents of the data field to
val.
Pre-conditions:
node: a node
created by create()
val: a data value
to be stored
Post-conditions:
stores the new data
value, replacing the existing value
Return
none
"""
assert node is not None, "set_data() called
with argument None"
node['data'] = val
def set_next(node, val):
"""
Set the contents of the next field to
val.
Pre-conditions:
node: a node
created by create()
val: a node, or the
value None
Post-conditions:
stores the new next
value, replacing the existing value
Return
none
"""
assert node is not None, "set_next() called
with argument None"
node['next'] = val
I am not able to get what are you trying to ask, the program given by you is correct and need no modification What's your question?
Below is the Python code I hope that i have provided sufficient comments for your better understanding Note that I have done proper indentation but this code is automatically left alligned on this interface
def create(data, next=None):
return {'data':data, 'next':next}
def get_data(node):
assert node is not None, "get_data() called with
argument None"
return node['data']
def get_next(node):
assert node is not None, "get_next() called with
argument None"
return node['next']
def set_data(node, val):
assert node is not None, "set_data() called with
argument None"
node['data'] = val
def set_next(node, val):
assert node is not None, "set_next() called with
argument None"
node['next'] = val
I have tried to explain it in very simple language and I hope that i have answered your question satisfactorily.Leave doubts in comment section if any.
Question 1 Continues *** This is the NODE ADT you need. I hope this will help...
Finish each function python 3 LList.py class node(object): """ A version of the Node class with public attributes. This makes the use of node objects a bit more convenient for implementing LList class. Since there are no setters and getters, we use the attributes directly. This is safe because the node class is defined in this module. No one else will use this version of the class. ''' def __init__(self, data, next=None): """ Create a new node for...
Exercise 1: BSTree operations For this exercise you'll implement three additional methods in the binary search tree data structure completed in class, so that you have an opportunity to practice both using the recursive pattern covered in class and navigating the binary tree structure. The methods you'll implement are: count_less_than: takes an argument x, and returns the number of elements in the tree with values less than x successor: takes an argument x, and returns the smallest value from the...
PYTHON 3 node Node ADT Question. Question 3 (18 points): Purpose: To practice working with node chains created using the Node ADT to implement slightly harder functionality Degree of Difficulty: Moderate to Tricky In this question you'll implement merge sort for node chains! Recall, merge sort is a divide-and-conquer technique that uses recursion to sort a given sequence (in this case a node chain). A overview of the algorithm is given below. Algorithm mergeSort (NC) Borts node chain NC using...
Hi, I hope I can get some help with the following exercise in C++( CPP): 1.Write an additional method called push_back(int) that will add an integer to the end of the list. You can modify the provided code. 2.Modify the Node class and LinkedList class so that you can access your parent node (double linked-list). /* definition of the list node class */ class Node { friend class LinkedList; private: int value; Node *pNext; public: /* Constructors with No Arguments...
PYTHON. Continues off another code. I don't understand this. Someone please help! Comment the lines please so I can understand LinkedList ADT: class myLinkedList: def __init__(self): self.__head = None self.__tail = None self.__size = 0 def insert(self, i, data): if self.isEmpty(): self.__head = listNode(data) self.__tail = self.__head elif i <= 0: self.__head = listNode(data, self.__head) elif i >= self.__size: self.__tail.setNext(listNode(data)) self.__tail = self.__tail.getNext() else: current = self.__getIthNode(i - 1) current.setNext(listNode(data,...
**TStack.py below** # CMPT 145: Linear ADTs # Defines the Stack ADT # # A stack (also called a pushdown or LIFO stack) is a compound # data structure in which the data values are ordered according # to the LIFO (last-in first-out) protocol. # # Implementation: # This implementation was designed to point out when ADT operations are # used incorrectly. def create(): """ Purpose creates an empty stack Return an empty stack """ return '__Stack__',list() def is_empty(stack): """...
PYTHON. Continues off another code(other code is below). I don't understand this. Someone please help! Comment the lines please so I can understand. There are short and med files lengths for each the list of names/ids and then search id file. These are the input files: https://codeshare.io/aVQd46 https://codeshare.io/5M3XnR https://codeshare.io/2W684E https://codeshare.io/5RJwZ4 LinkedList ADT to store student records(code is below). Using LinkedList ADT instead of the Python List. You will need to use the Student ADT(code is below) Imports the Student class...
Hi, I hope I can get some help with the following exercise in C++( CPP): 1.Write an additional method called push_back(int) that will add an integer to the end of the list. You can modify the provided code. 2.Modify the Node class and LinkedList class so that you can access your parent node (double linked-list). #include #include using namespace std; typedef int Type; enum Boolean { False = 0, True }; class Item { friend class SLList; public: Type getVal()...
Python question. i have to start from an empty linked list, using the method addNodeEnd() to add the nodes containing the values (3*i+5)%17, where i is from 0 to 10. Then print the values of all the nodes in this linked list to the screen. This is the code that i created right here and i need help checking if i made any mistakes thanks! The code is below: class Node: def __init__(self, data): self.data = data self.next = None...
I need help implemeting the remove_repetitions() Here is a brief outline of an algorithm: A node pointer p steps through the bag For each Item, define a new pointer q equal to p While the q is not the last Item in the bag If the next Item has data equal to the data in p, remove the next Item Otherwise move q to the next Item in the bag. I also need help creating a test program _____________________________________________________________________________________________________________________________________________________ #ifndef...