Store some addresses of variable to integer variable

[hqt]

I want to save address of the pointer point to to my variable:
So, I do that:

 
<Pointer>*a;
int tmp=*a; //hope that tmp will store address that pointer a point to

but the complier will give me an error:error: invalid conversion from 'Pointer**' to 'int.
So, how can I do that, please help me, please.

thanks

[laserlight]

Why do you want to do this?

[hqt]

Ah, I have a complete binary tree building by linked List. and of course, go to some node more difficult than if use array. and I want to convert this tree to array. (mean array[1]=address of first node, array[2]=address of second node, array[3]=address of third node,....). after that, I just use:

<pointer>*tmp=&array[i];

And, don't ask me, why I don't use array instead of linked list zz

thanks

[laserlight]

Ah, I have a complete binary tree building by linked List. and of course, go to some node more difficult than if use array. and I want to convert this tree to array. (mean array[1]=address of first node, array[2]=address of second node, array[3]=address of third node,....).

Create an array of pointers to the elements of the tree. Traverse over the tree and populate the array.

And, don't ask me, why I don't use array instead of linked list zz

Why don't you use an array instead of a linked list?

(Generally, I would not regard a tree as a linked list, though links are involved.)

[Ushakal]

You want a pointer to a pointer?

int* p		= new int;
int** pp	= &p;

Then pp contains the address of the pointer p.

You can even do this, though I'm not sure why you would:

int add		= (int)&p;

[Elysia]

It should be noted that
int add = (int)&p;
may result in truncation since the size of an int is not necessarily the size of a pointer (64-bit windows is a prime example).

[hqt]

Ah, array of pointer, I almost forget it :">
And yes, of course when building tree, array is more suitable than linked list in most case. But linked list is "natural", and some applications may be use linked list is absolutely compulsory (example fibbonaci Heap)

thanks

[laserlight]

What I meant was that the concept of a tree and the concept of a linked list are distinct. A tree generally would have some kind of branching (even if it effectively just a linked list in special cases) whereas a linked list is a linear sequence. That you could use an array to implement some kinds of tree structures and use links to nodes to implement other tree structures is a separate matter.