leetcode 208. Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods.

Note:
You may assume that all inputs are consist of lowercase letters a-z.

class TrieNode {

public:
	// Initialize your data structure here.
	//char val;
	bool isword;
	TrieNode*nxt[26];
	TrieNode() {
		for (int i = 0; i < 26; i++)
			nxt[i] = NULL;
		isword = false;
	}
};

class Trie {
public:
	Trie() {
		root = new TrieNode();
	}
	~Trie()
	{
		TrieNode*node = root;
		vector<TrieNode*>que, collect;
		que.push_back(root);
		while (!que.empty())
		{
			vector<TrieNode*>newque;
			for (int i = 0; i < que.size(); i++)
			{
				collect.push_back(que[i]);
				for (int j = 0; j < 26; j++)
					if (que[i]->nxt[j] != NULL)
						newque.push_back(que[i]->nxt[j]);
			}
			que = newque;
		}
		for (int i = 0; i < collect.size(); i++)
			delete collect[i];

	}
	// Inserts a word into the trie.
	void insert(string word) {
		string s = word;
		TrieNode*node = root;
		for (int i = 0; i < s.length(); i++)
		{
			if (node->nxt[s[i] - 'a'] == NULL)
			{
				TrieNode*n = new TrieNode();
				node->nxt[s[i] - 'a'] = n;
			}
			node = node->nxt[s[i] - 'a'];
		}
		node->isword = true;
	}

	// Returns if the word is in the trie.
	bool search(string word) {
		string s = word;
		TrieNode*node = root;
		for (int i = 0; i < s.length(); i++)
		{
			if (node->nxt[s[i] - 'a'] == NULL)
				return false;
			node = node->nxt[s[i] - 'a'];
		}
		if (node->isword)
			return true;
		return false;
	}

	// Returns if there is any word in the trie
	// that starts with the given prefix.
	bool startsWith(string prefix) {
		string s = prefix;
		TrieNode*node = root;
		for (int i = 0; i < s.length(); i++)
		{
			if (node->nxt[s[i] - 'a'] == NULL)
				return false;
			node = node->nxt[s[i] - 'a'];
		}
		return true;
	}

private:
	TrieNode* root;
};

accepted