Hello, I'm studying algorithom. For concentrating on the question itself, I
intend to use Python to implement the algorithoms.
Now, I want to write a Red-Black Tree, and a List structure. In C/C++, I
can
use pointers to refer to children notes (or next notes). But, in
Python, how
can I do it? Except the sequence, I know not any way.
You'd better help me understan how can I transform the following C code into
Python:
/* a List */
struct {
int data;
int *next;
int *prev;
}
That's all. Thanks!
Kermit
--
http://mail.python.org/mailman/listinfo/python-list
