Skip to main content

Singly LinkedList operations package

Project description

A pacakage consists of standard most used operations perform on Singly LinkedList Example:

NOTE: class name is: linkedlist.

  1. Insertion [ head , tail , Index]

For Insertion of node

Use: Create Object of class name: Now: Call function:
Here: For Head: object.insert_at_head(value) For Tail: object.insert_at_head(value) For Index: object.insert_at_index(indexposition,value)

############################################################

  1. Deletion [ head , tail , By value ]

For deletion of node

Use: Create Object of class name: Now: Call function:
Here: For Head: object.delete_at_head() For Tail: object.delete_at_tail() For By Value: object.delete_by_value(value)

############################################################

  1. Finding Length of linkedlist

To find length of linkedlist

Use: Create Object of class name: Now: Call function:
Here: length = object.length(head) # [ Send head as a paramter and it will return length ]

############################################################

  1. Reversing a linkedlist

To Reversing a linkedlist

Use: Create Object of class name: Now: Call function:
Here: object.reverse()

############################################################

  1. Searching node in linkedlist

Use: Create Object of class name: Now: Call function:
Here: temp = object.search(value) [It will return index of value if found or else it will return -1]

############################################################

  1. Finding Middle node of Linkedlist

Use: Create Object of class name: Now: Call function:
Here: object.middle() [ It will return two value: if length of linkedlist is even then it will return two value as a middle if length of linkedlist is odd it will return one middle value and another as a -1 ]

############################################################

  1. Finding Occurence of Node in given LinkedList

Use: Create Object of class name: Now: Call function:
Here: total = object.occurence(value)

[It will return total number of occurence of value]

############################################################

  1. Finding Intersection of Two LinkedList

Use: Create Object of class name: Now: Call function:
Here: object.intersection(head1,head2)

[IT will find the intersection between two linkedlist and return head of new linkedlist ]

############################################################

  1. To Display LinkedList

Use: Create Object of class name: Now: Call function:
Here: object.display(head)

Change LOG

============ VERSION: 0.0.1

Date: 17-10-2023 --------- [ First Release ]

================

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

Rayuga35_LinkedList-0.0.1.tar.gz (4.5 kB view details)

Uploaded Source

File details

Details for the file Rayuga35_LinkedList-0.0.1.tar.gz.

File metadata

  • Download URL: Rayuga35_LinkedList-0.0.1.tar.gz
  • Upload date:
  • Size: 4.5 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/4.0.2 CPython/3.11.4

File hashes

Hashes for Rayuga35_LinkedList-0.0.1.tar.gz
Algorithm Hash digest
SHA256 d0feb1daf3c5f1312175cd537c55cfc9bdaf8e8cd2749a9a92d24b09d53a7bf2
MD5 6103a364eb62a2d45f43da31d2e1861c
BLAKE2b-256 3c95f627c7f31f3fc248f76108143244c815a6be56104bc26d69328e4169b6b5

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page