2 ms·
The tree mirror problem is funny. You don't even need to recurse. Just define a wrapper for the node object that gets left when right is accessed and right when
by AtlasBarfed 5y ago
The tree mirror problem is funny. You don't even need to recurse. Just define a wrapper for the node object that gets left when right is accessed and right when left is accessed. Voila!
Right and left are arbitrary anyway.
- throwmeawaycs 5y agoActually in our problem we wanted you to do it without a wrapper so while this works, 0/100
- AtlasBarfed 5y agoCan I rate your question? Why am I asking permission. 0/100