How to implement an iterator of mutable references to the values in the right edges of a Binary Search Tree?

Question

I implemented a simple Binary Search Tree in Rust (following CIS 198, it\'s great), and for learning I\'m doing iterators that just run through the right edges.

I c

Answer 1

I think you cannot split self into 2 mutable objects (one for the Item, one for self itself) without using some unsafe code.