Merge pull request #30 from ybrenning/master

Added LList access methods (#29)

Author: shree1999

LinkedList-dataStructure/LL-implementation/main.cpp

@@ -191,6 +191,49 @@ class LinkedList
         }
         cout << endl;
     }
+
+    int get(int index)
+    {
+        // Check whether node with this index exists
+        if (index < 0 || index >= this->totalNodes)
+        {
+            cout << "[WARNING] Index out of bounds!" << endl;
+            return -1;
+        }
+
+        // Iterate over nodes until we reach the index-th node
+        Node *curr = this->head;
+        for (int i = 0; i < index; i++)
+        {
+            curr = curr->link;
+        }
+
+        return curr->data;
+    }
+
+    int find(int data)
+    {
+        // Iterate through all nodes
+        // In the worst case we don't find the node and reach the end of the list
+        Node *curr = this->head;
+        for (int i = 0; i < this->totalNodes; i++)
+        {
+            // Check whether we found the data, if so return the index at which it lies
+            if (curr->data == data)
+            {
+                return i;
+            } else if(curr->link == NULL)
+            {
+                break;
+            }
+
+            curr = curr->link;
+        }
+        
+        // This means the loop terminated without finding the data
+        cout << "Could not find the node" << endl;
+        return -1;
+    }
 };
 
 int main()
@@ -221,5 +264,11 @@ int main()
 
     l.display();
 
+    cout << "Get Node: 2" << endl;
+    cout << l.get(2) << endl;
+
+    cout << "Find Node 8:" << endl;
+    cout << l.find(8) << endl;
+
     return 0;
 }