That's how a stack works, it's a "last-in, first-out" structure. The item at the top will always be the last item that was pushed:

#include <iostream>
#include <stack>

int main()
{
using...

The only thing Edward can think of is using a union like that isn't required to work even if the conversion is safe but a reinterpret_cast<> is. The rules say that assigning to one member of a union...

// Star is in the wrong place
void Field::*data(){
return NULL;
}

// Star is in the wrong place
// void* is the wrong return type
void Field::*clone() const{
return NULL;
}

One of Ed's favorite books is Inside the C++ Object Model (http://www.amazon.com/Inside-Object-Model-Stanley-Lippman/dp/0201834545). You're asking for a lot of hardcore low level info, and I doubt...

The ideal way to do this is to encapsulate the data into an object that defines a comparison operator. Then you can sort the objects instead of trying to sort parallel arrays:

#include <algorithm>...

>still use strtol()
Better to use stringstream:

#include <ios>
#include <iostream>
#include <sstream>

int main()
{
using namespace std;

#import isn't available in C or C++, but if you want the same effect of it, some compilers implement a special #pragma for header files called once:

#pragma once

// Header contents

That's...

Your use of pointers seems a little backwards, but the tree in your sample program is valid. Ed used a formatted display algorithm to see how it's structured. Here's something that is a bit more...

> That means, if one omits the for-init statement the semicolon also disappears.
That's not quite right, but Edward can easily see why you'd think that. Like most stuff in the standard, you have to...

Neither Matrix nor VNT need an explicit destructor, but the real problem is in the destructor for those two classes you try to delete objects that weren't returned by new:

> delete mat;
mat isn't...

> Meaning, if I opened up a table of contents, what would I look under to learn more about this subject.
Operator overloading, and probably stream I/O too. The exactly thing is overloading the...

> The char datatype is not guaranteed to be stored in a single byte, either.
char is guaranteed to equate to a byte, but a byte isn't guaranteed to be 8 bits. I think that's what you meant.

> But the following code is not working.c
Did you include the code for compose2? It's not a standard STL function, but Edward would guess that you mean to use the one defined in Nicolai Josuttis'...

> I have never in over 20 years seen anyone code a function prototype like that.
Edward has, but everyone has different experiences so there's no point arguing about what we've seen. :)

> Arrays...

The only real problem Edward sees is that you don't resize the dynamic array after the first call to AddFirst or AddLast. If you don't allocate the memory, you can't reliably write to it. Here is a...

> Why use getch() when there's a standard function: getchar()?
Because getchar() doesn't do what Edward needed.

getchar() is completely segregated from the console buffer such that the buffer...

Initializing numb is easy. Just start at 1 and double the last value until you get to the size of the array:

int k = 1;

for (int i = 0; i < 10; ++i) {
numb[i] = k;
k *= 2;
}
...

That's why Edward puts as much code as possible in namespaces. Compilers are bad about including all kinds of unexpected stuff in the standard headers, so even if you don't include unistd.h yourself,...

> there is no way to have separate classes from the class main()....
There isn't a class that contains the main function like in Java. main() is a global function and you can have it in a separate...

> What is so difficult to understand about this:
Is that a trick question? Of course it's difficult to understand if you haven't learned how it works yet. :-O Edward learned long ago that just...

Edward is guessing about how your tree interface is, but something like this makes sense if you're making a copy of the current tree and need a full tree in return:

//
// Non-recursive user...

You're printing the address of the pointer, not the address of the memory pointed to. Remove the address-of operator from your cout statement and you'll get the address of the memory that new gives...

> Horse h1(Distance(p));
This is an evil bug. C++ isn't seeing that line as an object definition, it's seeing the line as a function declaration. h1 is a function that returns a Horse object and...

> This should do what i want correct?
That's it. :) If you declare a pointer to BSNode<T>, that's all you have, a pointer. You can't reliably use that pointer until you set it to point to null or an...

gydytojas is a struct, but you use it like an object. The problem is the same as if you tried to say int.value = 5;, and the fix is to define a variable of gydytojas to work with. :)

You should abstract your data into objects so that it's easier to make changes and the design is clearer. Right now you have three vectors of data that should be encapsulated in a student class:
...