Search:

I kind of get it but hoo boy is that weird. I don't even know if I could code that. It's hard enough just to do on paper. Talk about messing with my mind.

Also, is it possible to rotate higher...

I mean, I lol'd but omfg, Lord forbid I was hoping for some human interaction XD

Lol what's a "right rotation"? Could you post or private message me some small example code? I mean, this isn't homework for me, I'm just genuinely curious.

Lol my bad, I meant a recursive traversal just to allocate nodes on the heap in the first place.

And yeah, I was also thinking about suggesting a parent pointer as well because, well, it works but...

I'm not gonna lie, I'm surprised you can even allocate a tree so deep without overflowing the stack in the first place. How does that work? Are you not starting at the root and working your way down?