Add files via upload

Author: AdityaSeth777

15 - Linked List/Solution.c

@@ -0,0 +1,23 @@
+#include <stdlib.h>
+#include <stdio.h>	
+typedef struct Node
+{
+    int data;
+    struct Node* next;
+}Node;
+
+Node* insert(Node *head,int data)
+{    Node * nod=
+     nod=(Node *)malloc(sizeof(Node));
+     nod->data=data;
+     if(head==NULL) {head =nod; return head;}
+     Node *p;
+     p=head;
+     while(p->next!=NULL)
+         p=p->next;
+     p->next=nod;
+     return head;    
+    //Aditya Seth
+}
+
+void display(Node *head)

15 - Linked List/Solution.cpp

@@ -0,0 +1,47 @@
+#include <iostream>
+
+using namespace std;
+
+class Node {
+public:
+    int data;
+    Node *next;
+
+    Node(int d) {
+        data = d;
+        next = NULL;
+    }
+};
+
+class Solution {
+public:
+    Node *insert(Node *head, int data) {
+        if (head == NULL) head = new Node(data);
+        else {
+            Node *curr = head;
+            while (curr->next) curr = curr->next;
+            curr->next = new Node(data);
+        }
+        return head;
+    }
+
+    void display(Node *head) {
+        Node *start = head;
+        while (start) {
+            cout << start->data << " ";
+            start = start->next;
+        }
+    }
+};
+//Aditya Seth
+int main() {
+    Node *head = NULL;
+    Solution mylist;
+    int T, data;
+    cin >> T;
+    while (T-- > 0) {
+        cin >> data;
+        head = mylist.insert(head, data);
+    }
+    mylist.display(head);
+}

15 - Linked List/Solution.kt

@@ -0,0 +1,35 @@
+data class Node(var data: Int) {
+    var next: Node? = null
+}
+
+fun insert(head: Node?, data: Int): Node {
+    if (head == null) {
+        return Node(data)
+    } else {
+        var curr: Node? = head
+        while (curr?.next != null) {
+            curr = curr.next
+        }
+        curr?.next = Node(data)
+    }
+    return head
+}
+
+fun display(head: Node?) {
+    var curr: Node? = head
+    while (curr != null) {
+        print(curr.data)
+        print(" ")
+        curr = curr.next
+    }
+}
+
+fun main(args: Array<String>) {
+    var head: Node? = null
+    var N = Integer.parseInt(readLine())
+    while (N-- > 0) {
+        val element = Integer.parseInt(readLine())
+        head = insert(head, element)
+    }
+    display(head)
+}

15 - Linked List/Solution.py

@@ -0,0 +1,31 @@
+class Node:
+    def __init__(self, data):
+        self.data = data
+        self.next = None
+
+
+class Solution:
+    def display(self, head):
+        current = head
+        while current:
+            print(current.data, end=' ')
+            current = current.next
+
+    def insert(self, head, data):
+        if head is None:
+            head = Node(data)
+        else:
+            curr = head
+            while curr.next:
+                curr = curr.next
+            curr.next = Node(data)
+        return head
+
+#Aditya Seth
+mylist = Solution()
+T = int(input())
+head = None
+for i in range(T):
+    data = int(input())
+    head = mylist.insert(head, data)
+mylist.display(head)

15 - Linked List/Solution.rb

@@ -0,0 +1,42 @@
+class Node
+
+    attr_accessor :data,:next
+
+  def initialize data
+        @data = data
+        @next = nil
+    end
+end
+
+class Solution
+    def insert(head,value)
+        #Aditya Seth
+          if head.nil?
+              head = Node.new value
+          else
+              curr= head
+              until (curr.next.nil?) do
+                  curr = curr.next
+              end
+              curr.next = Node.new value
+          end
+          
+          head
+    end
+    def display(head)
+        current = head
+        while current 
+           print current.data," "
+           current = current.next
+        end
+    end
+end
+       
+mylist= Solution.new
+head=nil
+T=gets.to_i
+for i in 1..T
+    data=gets.to_i
+    head=mylist.insert(head,data)
+end
+mylist.display(head)