-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProgram.cs
More file actions
47 lines (41 loc) · 1.23 KB
/
Program.cs
File metadata and controls
47 lines (41 loc) · 1.23 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
using DataStructures.Structures;
using System;
namespace DataStructures
{
class Program
{
static void Main(string[] args)
{
// LinkedList<int> list = new LinkedList<int>();
// NewStack<int> stack = new NewStack<int>();
// HashTable<int> hashTable = new HashTable<int>(size);
// NewDictionary<int, string> dict = new NewDictionary<int, string>(100);
// NewQueue<int> queue = new NewQueue<int>();
// NewQueueArray<int> queueArray = new NewQueueArray<int>(100);
// BinaryTree<int> binaryTree = new BinaryTree<int>();
// PrefixTree<int> prefixTree = new PrefixTree<int>();
// SimpleHeap heap = new SimpleHeap();
// Graph graph = new Graph();
// DoublyLinkedList<int> doublyList = new DoublyLinkedList<int>();
// Deque<int> deque = new Deque<int>();
// SimpleSet<int> set = new SimpleSet<int>(); //// HashSet<T> in System.Collections.Generic
}
#region Print HashTable
public static void PrintHashTable<T>(HashTable<T> hashTable)
{
foreach (var item in hashTable.Items)
{
if (item.Nodes.Count != 0)
{
Console.Write(item.Key + ": ");
foreach (var value in item.Nodes)
{
Console.Write(value + " ");
}
Console.WriteLine();
}
}
}
#endregion
}
}