trie_multiple_search.cpp File Reference

Trie datastructure with search variants More...

#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstring>
#include <iostream>
#include <queue>

Include dependency graph for trie_multiple_search.cpp:

Classes
class	operations_on_datastructures::trie_operations::Tnode
	Class defining the structure of trie node and containing the methods to perform operations on them. More...

Namespaces
	operations_on_datastructures
	for std::priority_queue
	trie_operations
	Functions for Trie datastructure implementation.

Functions
static void	test ()
	Function to test a simple search before and after deleting an entry. And to test out the multiple variants of search.
int	main (int argc, char const *argv[])
	Main function. More...

Detailed Description

Trie datastructure with search variants

This provides multiple variants of search functions on a trie structure utilizing STL. The trie is valid for only English alphabets.

Author

Ghanashyam

Function Documentation

main()

int main	(	int	argc,
		char const *	argv[]
	)

Main function.

Parameters

argc	commandline argument count (ignored)
argv	commandline array of arguments (ignored)

Returns

0 on exit

                                       {
    test();  // run self-test implementations
    return 0;
}

Here is the call graph for this function: