TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
Loading...
Searching...
No Matches
data_structures::trie_using_hashmap::Trie::Node Struct Reference

struct representing a trie node. More...

Collaboration diagram for data_structures::trie_using_hashmap::Trie::Node:
[legend]

Public Attributes

std::unordered_map< char16_t, std::shared_ptr< Node > > children
 
bool word_end = false
 boolean variable to represent the node end
 

Detailed Description

struct representing a trie node.

Definition at line 44 of file trie_using_hashmap.cpp.

Member Data Documentation

◆ children

std::unordered_map<char16_t, std::shared_ptr<Node> > data_structures::trie_using_hashmap::Trie::Node::children

unordered map with key type char16_t and value is a shared pointer type of Node

Definition at line 46 of file trie_using_hashmap.cpp.

◆ word_end

bool data_structures::trie_using_hashmap::Trie::Node::word_end = false

boolean variable to represent the node end

Definition at line 48 of file trie_using_hashmap.cpp.


The documentation for this struct was generated from the following file: