Add unimplemented cs classes to datastructures

mvalenta · mvalenta · commit 82dc8c4546fa · 2018-05-24T21:22:10.000-04:00
diff --git a/CSharpAlgorithms.DataStructures/Class1.cs b/CSharpAlgorithms.DataStructures/Class1.cs
diff --git a/CSharpAlgorithms.DataStructures/disjoint-set/DisjointSet.cs b/CSharpAlgorithms.DataStructures/disjoint-set/DisjointSet.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.disjoint_set
+{
+    class DisjointSet
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/disjoint-set/DisjointSetItem.cs b/CSharpAlgorithms.DataStructures/disjoint-set/DisjointSetItem.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.disjoint_set
+{
+    class DisjointSetItem
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/graph/Graph.cs b/CSharpAlgorithms.DataStructures/graph/Graph.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.graph
+{
+    class Graph
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/graph/GraphEdge.cs b/CSharpAlgorithms.DataStructures/graph/GraphEdge.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.graph
+{
+    class GraphEdge
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/graph/GraphVertex.cs b/CSharpAlgorithms.DataStructures/graph/GraphVertex.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.graph
+{
+    class GraphVertex
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/hash-table/HashTable.cs b/CSharpAlgorithms.DataStructures/hash-table/HashTable.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.hash_table
+{
+    class HashTable
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/heap/MinHeap.cs b/CSharpAlgorithms.DataStructures/heap/MinHeap.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.heap
+{
+    class MinHeap
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/linked-list/LinkedList.cs b/CSharpAlgorithms.DataStructures/linked-list/LinkedList.cs
@@ -109,9 +109,8 @@ public LinkedListNode Find(object item)
         /// <summary>
         /// Delete the tail node
         /// </summary>
-        /// <param name="node"></param>
         /// <returns></returns>
-        public LinkedListNode DeleteTail(LinkedListNode node)
+        public LinkedListNode DeleteTail()
         {
             var temp = Tail;
             if (Head == Tail)
@@ -142,9 +141,8 @@ public LinkedListNode DeleteTail(LinkedListNode node)
         /// <summary>
         /// Delete the head node
         /// </summary>
-        /// <param name="node"></param>
         /// <returns></returns>
-        public LinkedListNode DeleteHead(LinkedListNode node)
+        public LinkedListNode DeleteHead()
         {
             if (Head == Tail)
                 return null;
diff --git a/CSharpAlgorithms.DataStructures/priority-queue/PriorityQueue.cs b/CSharpAlgorithms.DataStructures/priority-queue/PriorityQueue.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.priority_queue
+{
+    class PriorityQueue
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/queue/Queue.cs b/CSharpAlgorithms.DataStructures/queue/Queue.cs
@@ -0,0 +1,45 @@
+using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.queue
+{
+    public class Queue
+    {
+        public linked_list.LinkedList list { get; set; }
+        public Queue()
+        {
+            list = new linked_list.LinkedList();
+        }
+
+        public bool IsEmpty()
+        {
+            return list.Tail == null;
+        }
+
+        public object Peek()
+        {
+            if(list.Head == null){
+                return null;
+            }
+            return list.Head.Item;
+        }
+        public void Enqueue(object item)
+        {
+            list.Append(item);
+        }
+        public object Dequeue()
+        {
+            var removedHead = list.DeleteHead();
+            if(removedHead == null)
+            {
+                return null;
+            }
+            return removedHead.Item;
+        }
+        public override string ToString() 
+        {
+            return list.ToString();    
+        }
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/queue/Queue.js b/CSharpAlgorithms.DataStructures/queue/Queue.js
diff --git a/CSharpAlgorithms.DataStructures/queue/__test__/Queue.test.js b/CSharpAlgorithms.DataStructures/queue/__test__/Queue.test.js
diff --git a/CSharpAlgorithms.DataStructures/stack/Stack.cs b/CSharpAlgorithms.DataStructures/stack/Stack.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.stack
+{
+    class Stack
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/tree/BinaryTreeNode.cs b/CSharpAlgorithms.DataStructures/tree/BinaryTreeNode.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.tree
+{
+    class BinaryTreeNode
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/tree/avl-tree/AvlTree.cs b/CSharpAlgorithms.DataStructures/tree/avl-tree/AvlTree.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.tree.avl_tree
+{
+    class AvlTree
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/tree/binary-search-tree/BinarySearchTree.cs b/CSharpAlgorithms.DataStructures/tree/binary-search-tree/BinarySearchTree.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.tree.binary_search_tree
+{
+    class BinarySearchTree
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/tree/binary-search-tree/BinarySearchTreeNode.cs b/CSharpAlgorithms.DataStructures/tree/binary-search-tree/BinarySearchTreeNode.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.tree.binary_search_tree
+{
+    class BinarySearchTreeNode
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/trie/Trie.cs b/CSharpAlgorithms.DataStructures/trie/Trie.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.trie
+{
+    class Trie
+    {
+    }
+}
diff --git a/CSharpAlgorithms.DataStructures/trie/TrieNode.cs b/CSharpAlgorithms.DataStructures/trie/TrieNode.cs
@@ -0,0 +1,10 @@
+﻿using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace CSharpAlgorithms.DataStructures.trie
+{
+    class TrieNode
+    {
+    }
+}
