Implimentation for the Trie data structure #8

New Issue

claunia · 2026-01-29T15:00:17Z

claunia commented

2026-01-29 15:00:17 +00:00

Originally created by @shashikedissanayake on GitHub (Sep 28, 2017).

In the data structure section there doesn't have Trie data structure. A Trie is a special data structure used to store strings that can be visualized like a graph.That is mostly used in Search Engines, Genome Analysis, Data Analytics. So I would like to implement Trie using C.

Originally created by @shashikedissanayake on GitHub (Sep 28, 2017). In the data structure section there doesn't have Trie data structure. A Trie is a special data structure used to store strings that can be visualized like a graph.That is mostly used in Search Engines, Genome Analysis, Data Analytics. So I would like to implement Trie using C.

claunia closed this issue

2026-01-29 15:00:18 +00:00

claunia commented

2026-01-29 15:00:19 +00:00

@dynamitechetan commented on GitHub (Sep 28, 2017):

Sure. 🎉

@dynamitechetan commented on GitHub (Sep 28, 2017): Sure. 🎉

claunia commented

2026-01-29 15:00:21 +00:00

@shashikedissanayake commented on GitHub (Sep 28, 2017):

For the testing purpose should I have to write a main method to demonstrate the implementation?

@shashikedissanayake commented on GitHub (Sep 28, 2017): For the testing purpose should I have to write a main method to demonstrate the implementation?

claunia referenced this issue

2026-01-29 15:10:00 +00:00

[PR #8] [MERGED] Add insertion sort method #219

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#8