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)
############################################################
2. 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)
############################################################
3. 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 ]
############################################################
4. Reversing a linkedlist
To Reversing a linkedlist
Use: Create Object of class name:
Now: Call function:
Here: object.reverse()
############################################################
5. 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]
############################################################
6. 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
]
############################################################
7. 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]
############################################################
8. 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 ]
############################################################
9. 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 ]
================
Raw data
{
"_id": null,
"home_page": "",
"name": "Rayuga35-LinkedList",
"maintainer": "",
"docs_url": null,
"requires_python": "",
"maintainer_email": "",
"keywords": "python,tutorial,LinkedList,Operations,Shubham,Data Structure,Insertion,Reverse,Deletion,Occurence,Length,Intersection",
"author": "Shubham Vishwakarma",
"author_email": "vishwakarmashubham.2503@gmail.com",
"download_url": "https://files.pythonhosted.org/packages/3c/95/f627c7f31f3fc248f76108143244c815a6be56104bc26d69328e4169b6b5/Rayuga35_LinkedList-0.0.1.tar.gz",
"platform": null,
"description": "A pacakage consists of standard most used operations perform on Singly LinkedList Example: \r\n\r\nNOTE: class name is: linkedlist.\r\n\r\n1. Insertion [ head , tail , Index]\r\n\r\nFor Insertion of node\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: For Head: object.insert_at_head(value)\r\n For Tail: object.insert_at_head(value)\r\n For Index: object.insert_at_index(indexposition,value)\r\n\r\n############################################################\r\n\r\n2. Deletion [ head , tail , By value ]\r\n\r\nFor deletion of node\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: For Head: object.delete_at_head()\r\n For Tail: object.delete_at_tail()\r\n For By Value: object.delete_by_value(value)\r\n\r\n############################################################\r\n\r\n3. Finding Length of linkedlist\r\n\r\nTo find length of linkedlist\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: length = object.length(head) # [ Send head as a paramter and it will return length ]\r\n\r\n############################################################\r\n\r\n4. Reversing a linkedlist\r\n\r\nTo Reversing a linkedlist\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: object.reverse()\r\n\r\n############################################################\r\n\r\n5. Searching node in linkedlist\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: temp = object.search(value) [It will return index of value if found or else it will return -1]\r\n\r\n############################################################\r\n\r\n6. Finding Middle node of Linkedlist\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: object.middle() \r\n[\r\nIt will return two value:\r\nif length of linkedlist is even then it will return two value as a middle\r\nif length of linkedlist is odd it will return one middle value and another as a -1\r\n]\r\n\r\n############################################################\r\n\r\n7. Finding Occurence of Node in given LinkedList\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: total = object.occurence(value)\r\n\r\n[It will return total number of occurence of value]\r\n\r\n############################################################\r\n\r\n8. Finding Intersection of Two LinkedList\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: object.intersection(head1,head2)\r\n\r\n[IT will find the intersection between two \r\nlinkedlist and return head of new linkedlist ]\r\n\r\n############################################################\r\n\r\n9. To Display LinkedList\r\n\r\nUse: Create Object of class name:\r\nNow: Call function: \r\nHere: object.display(head)\r\n\r\n\r\nChange LOG\r\n\r\n============\r\nVERSION: 0.0.1\r\n\r\nDate: 17-10-2023 --------- [ First Release ]\r\n\r\n================\r\n",
"bugtrack_url": null,
"license": "",
"summary": "Singly LinkedList operations package",
"version": "0.0.1",
"project_urls": null,
"split_keywords": [
"python",
"tutorial",
"linkedlist",
"operations",
"shubham",
"data structure",
"insertion",
"reverse",
"deletion",
"occurence",
"length",
"intersection"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "3c95f627c7f31f3fc248f76108143244c815a6be56104bc26d69328e4169b6b5",
"md5": "6103a364eb62a2d45f43da31d2e1861c",
"sha256": "d0feb1daf3c5f1312175cd537c55cfc9bdaf8e8cd2749a9a92d24b09d53a7bf2"
},
"downloads": -1,
"filename": "Rayuga35_LinkedList-0.0.1.tar.gz",
"has_sig": false,
"md5_digest": "6103a364eb62a2d45f43da31d2e1861c",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 4504,
"upload_time": "2023-10-16T19:38:45",
"upload_time_iso_8601": "2023-10-16T19:38:45.095766Z",
"url": "https://files.pythonhosted.org/packages/3c/95/f627c7f31f3fc248f76108143244c815a6be56104bc26d69328e4169b6b5/Rayuga35_LinkedList-0.0.1.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2023-10-16 19:38:45",
"github": false,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"lcname": "rayuga35-linkedlist"
}
JSON