diff --git a/operations_on_datastructures/get_size_of_linked_list.cpp b/operations_on_datastructures/get_size_of_linked_list.cpp
new file mode 100644
index 000000000..84f8db07f
--- /dev/null
+++ b/operations_on_datastructures/get_size_of_linked_list.cpp
@@ -0,0 +1,36 @@
+#include <iostream>
+
+class Node {
+ public:
+    int val;
+    Node *next;
+
+    Node(int v, Node *n) : val(v), next(n) {}  // Default constructor for Node
+};
+
+int getSize(Node *root) {
+    if (root == NULL) {
+        return 0;
+    }
+    // Each node will return 1 so the total adds up to be the size
+    return 1 + getSize(root->next);
+}
+
+int main() {
+    Node *myList = new Node(0, NULL);  // Initializes the LinkedList
+    Node *temp = myList;
+    // Creates a linked lists of total size 10, numbered 1 - 10
+    for (int i = 1; i < 10; i++) {
+        temp->next = new Node(i, NULL);
+        temp = temp->next;
+    }
+    // Creating other lists for checking purposes
+    Node *secondList = new Node(0, NULL);  // List of size 1
+    Node *thirdList = NULL;                // List of size 0
+
+    std::cout << getSize(myList) << std::endl
+              << getSize(secondList) << std::endl
+              << getSize(thirdList) << std::endl;
+
+    return 0;
+}