GitHub - Emracooool/DataStructure: Some basic data structure implementations in C#, including binary search tree, trie, max bipartite matching, inverse multiply, etc.

Emracooool / DataStructure Public

Some basic data structure implementations in C#, including binary search tree, trie, max bipartite matching, inverse multiply, etc.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.gitattributes		.gitattributes
.gitignore		.gitignore
2DAVLTree.cs		2DAVLTree.cs
2DAVLTreeNode.cs		2DAVLTreeNode.cs
AVLBST.cs		AVLBST.cs
AVLTreeCPC.cs		AVLTreeCPC.cs
AVLTreeNode.cs		AVLTreeNode.cs
AVLTreeNodeCPC.cs		AVLTreeNodeCPC.cs
BinarySearchTree.cs		BinarySearchTree.cs
DataStructure.csproj		DataStructure.csproj
HLD.cs		HLD.cs
MatrixFunction.cs		MatrixFunction.cs
MaxBipartiteMatching.cs		MaxBipartiteMatching.cs
ModFunction.cs		ModFunction.cs
Permute.cs		Permute.cs
Program.cs		Program.cs
RangeMinimumQuery.cs		RangeMinimumQuery.cs
RangeTree.cs		RangeTree.cs
RangeTree2D.cs		RangeTree2D.cs
RangeTree3D.cs		RangeTree3D.cs
RangeTreeNode.cs		RangeTreeNode.cs
RangeTreeNode2D.cs		RangeTreeNode2D.cs
RangeTreeNode3D.cs		RangeTreeNode3D.cs
SegTreeAdd.cs		SegTreeAdd.cs
SegTreeMax.cs		SegTreeMax.cs
SegmentTree.cs		SegmentTree.cs
TreeNode.cs		TreeNode.cs
Trie.cs		Trie.cs