<jupyter_start><jupyter_text>Singly Linked List ImplementationIn this lecture we will implement a basic Singly Linked List.Remember, in a singly linked list, we have an ordered list of items as individual Nodes that have pointers to other Nodes.<jupyter_code>class Node(object):
    
    def __init__(self,value):
        
        self.value = value
        self.nextnode = None<jupyter_output><empty_output><jupyter_text>Now we can build out Linked List with the collection of nodes:<jupyter_code>a = Node(1)
b = Node(2)
c = Node(3)
a.nextnode = b
b.nextnode = c<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.07925801011804384, 'fraction_numerical': 0.00505902192242833, 'mean_word_length': 4.4495412844036695, 'pattern_counts': {'":': 0, '<': 9, '<?xml version=': 0, '>': 9, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '2', 'dir': 'jupyter-structured-clean-dedup', 'id': '464065', 'license': 'MIT', 'n_tokens_mistral': 192, 'n_tokens_neox': 188, 'n_words': 62, 'path': 'all_notebooks/14-Linked Lists/Singly Linked List Implementation.ipynb', 'repo_name': 'robjpar/pdsa', 'size': '593'}