Can them be implemented using stacks? Two stacks, one is called ls and
the other is rs.
I agree. Two things are needed, 1st, for each trackable action, a
reverse action should be recorded in order to perform the undo action.
The action itself must be recoreded as well for redo action. 2nd, two
st
On Sep 19, 2:47 pm, let_the_best_man_win <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I am looking for a good algorithm (in C/C++) for implementing undo/
> redo on a data structure.
>
> The data structure is basically a n-children tree somewhat of the
> form :
>
> class /* or struct */ node {
> char *
