dev/ll_tries.cpp
bool isEmpty(TrieNode* root) 
{ 
	Node *ptr = (Node *)root->root;
	if (ptr != NULL && ptr->next == NULL)
		return false;
	return true;
}
// Returns true if root has no children, else false 
Returns true if root has no children, else false
Returns true if root has no children else false
bool isEmpty(TrieNode* root) 
{ 
	Node *ptr = (Node *)root->root;
	if (ptr != NULL && ptr->next == NULL)
		return false;
	return true;
}
bool isEmpty ( TrieNode * root ) { Node * ptr = ( Node * ) root -> root ; if ( ptr != NULL && ptr -> next == NULL ) return false ; return true ; }
Returns true if root has no children, else false
Returns true if root has no children else false