On Wednesday, 14 October 2015 at 14:42:31 UTC, Namal wrote:
Hello,

I don't remember exactly but I think when I first saw D code there was tree datatype implemented without pointers. Is it possible to make a tree struct without pointers?

The answer is more or less no, unless you sort of fake it like in cym13's example. A tree is not possible without pointers due to its recursive nature. Even if it looks like the implementation doesn't use pointers, they're just hidden under some abstraction.

Reply via email to