Managed C++/CLI

map<key,data>::iterator it 
 it = some_map_or_other.find( the_key ); 
 if ( it != some_map_or_other.end() ) {
//the key exists
 }

darylesha wrote:

I need help writing the code to delete from a binary search tree if any body code offer up some C++ code for this it would be greatly appreciated!

String BaseConversion(int Number, int Base)	// return string, accept two integers
{	
    int digit;
    Stack stack = new Stack();	            // instantiate new stack object
    while (Number >= Base)                  // now the repetitive loop is clearly seen
    {	
	stack.push(Number % base); 	    // store a digit
	Number = Number/Base;	            // find new 'number'
    }	
	    
    digit = Number                          // the remainder is the first digit
    // now it's time to collect the digits together	
    String str = new String("" + digit)     // create a string with a single digit 
    while (stack.NotEmpty())	
       str = str+stack.pop()	            // get next digit from the stack
    
    return str;	
}

<code>
   std::string strBase2;
   std::string strBase8;
   std::string strBase16;

   // converting from base 10 to base 2:
   strBase2 = BaseConversion(no, 2);
   // display the result to the console
   printf("%d [Base 10] = %s [base 2]", no, strBase2);

   // converting from base 10 to base 2:
   strBase8 = BaseConversion(no, 8);
   // display the result to the console
   printf("%d [Base 10] = %s [base 8]", no, strBase2);

   // converting from base 10 to base 2:
   strBase16 = BaseConversion(no, 16);
   // display the result to the console
   printf("%d [Base 10] = %s [base 16]", no, strBase2);
</code>