Add Trie data structure.

[HarsheetKakar]

Description of the problem

Example of the problem

References/Other comments

Reference

[czgdp1807]

Please propose an API for the Trie data structure.

[HarsheetKakar]

TrieNode:
The class TrieNode will extend from Node base class to represent a node in Trie
Attributes:

• children- dict() to represent children of the node
• is_end- Boolean to represent leaf position.

Trie:
The class Trie to represent data structure Trie.
Attributes:

• root- start Node.

Methods:

• insert(string): insert a string in Trie
• search(string): takes string and returns True if full match else returns list of partial matches
• delete(string): delete a string from Trie

[czgdp1807]

• _index(symbol: Char): takes in symbol and gives it index position in Node.children

Why do we need this?

[czgdp1807]

• children- array of None initially for number of symbols possible

Can we go for python dict with TrieNode as key?

[czgdp1807]

• size- total nodes in Trie

Why we need this too?

[HarsheetKakar]

• children- array of None initially for number of symbols possible

Can we go for python dict with TrieNode as key?

sure, would be better

[HarsheetKakar]

• _index(symbol: Char): takes in symbol and gives it index position in Node.children

Why do we need this?

not if we use dict

[HarsheetKakar]

• size- total nodes in Trie

Why we need this too?

not really needed.

[robotjellyzone]

Hi @HarsheetKakar are still working on this ? Any update ?