#include<iostream>
  #include<string>
  #include<cstring>

  using namespace std;
  void condense_by_removing(char *x, char y);

  int main()
  {
	char *string;
	string = new char[50];
	cout << "ENter your name: ";
	cin >> string;
	cout << endl << "Enter the character to remove: ";
	char ch;
	cin >> ch;
	condense_by_removing(string, ch);
	cout << endl << "new string is: " << *string;

	char dit;
	cin >> dit;

	return 0;
  } 

  void condense_by_removing(char *z_terminated, char  char_to_remove)
  {
	char *chPtr = new char;
	char *trailPtr = new char;

	for(int i = 0; i <= strlen(z_terminated); ++i)
	{
		chPtr = z_terminated;
		if(z_terminated[i] == char_to_remove)
		{
			trailPtr = chPtr;
			delete chPtr;
		}
	}
  }

Just finished a Data Structures class and still wrapping my head around Trees and hashing.

Thank you, kindly.