Trie implementation in C++

Trie.cpp

#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
struct TrieNode
{
	map<char,TrieNode*> children;
	int prefixes;
	bool endofword;
	TrieNode()
	{
		prefixes=0;
		endofword=false;
	}
};
void insert(TrieNode *root,string word)
{
	TrieNode *current=root;
	for(int i=0;i<word.size();i++)
	{
		char ch=word[i];
		TrieNode *node=current->children[ch];
		if(!node)
		{
			node=new TrieNode();
			current->children[word[i]]=node;
		}
		current=node;
		current->prefixes++;
	}
	current->endofword=true;
}
bool search(TrieNode *root,string word)
{
	TrieNode *current=root;
	for(int i=0;i<word.size();i++)
	{
		char ch=word[i];
		TrieNode *node=current->children[ch];
		if(!node)
			return false;
		current=node;
	}
	return current->endofword;
}
int count_prefix(TrieNode *root,string word)
{
	TrieNode *current=root;
	for(int i=0;i<word.size();i++)
	{
		char ch=word[i];
		TrieNode *node=current->children[ch];
		if(!node)
		{
			return 0;
		}
		current=node;
	}
	return current->prefixes;
}

int main()
{
	TrieNode *root=new TrieNode();
	insert(root,"harshita");
	insert(root,"harsh");
	insert(root,"sharma");
	insert(root,"harry");
	string p;
	cout<<"Enter the prefix :";
	cin>>p;
	cout<<count_prefix(root,p)<<endl;
	return 0;
}

Could you please give the code for DFS/BFS implementation using the map.
thank you in advance.