Compilare: In file included from /usr/include/c++/12.2.1/unordered_map:46, from main.cpp:2: In member function 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::__node_base_ptr std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_M_find_before_node(const key_type&) [with _Key = char; _Value = std::pair<const char, TrieNode*>; _Alloc = std::allocator<std::pair<const char, TrieNode*> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<char>; _Hash = std::hash<char>; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<false, false, true>]', inlined from 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::size_type std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_M_erase(std::true_type, const key_type&) [with _Key = char; _Value = std::pair<const char, TrieNode*>; _Alloc = std::allocator<std::pair<const char, TrieNode*> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<char>; _Hash = std::hash<char>; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<false, false, true>]' at /usr/include/c++/12.2.1/bits/hashtable.h:2350:34, inlined from 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::size_type std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::erase(const key_type&) [with _Key = char; _Value = std::pair<const char, TrieNode*>; _Alloc = std::allocator<std::pair<const char, TrieNode*> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<char>; _Hash = std::hash<char>; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<false, false, true>]' at /usr/include/c++/12.2.1/bits/hashtable.h:973:24, inlined from 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::size_type std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::erase(const key_type&) [with _Key = char; _Tp = TrieNode*; _Hash = std::hash<char>; _Pred = std::equal_to<char>; _Alloc = std::allocator<std::pair<const char, TrieNode*> >]' at /usr/include/c++/12.2.1/bits/unordered_map.h:763:26, inlined from 'void Trie::remove(const std::string&)' at main.cpp:88:44, inlined from 'int main()' at main.cpp:114:28: /usr/include/c++/12.2.1/bits/hashtable.h:1908:11: warning: 'last_valid_char' may be used uninitialized [-Wmaybe-uninitialized] 1908 | if (this->_M_key_equals(__k, *__p)) | ^~ main.cpp: In function 'int main()': main.cpp:68:14: note: 'last_valid_char' was declared here 68 | char last_valid_char; | ^~~~~~~~~~~~~~~