Given the root of a binary tree, invert the tree, and return its root. Thoughts Seems like a pretty simple problem, I would imagine that doing this recursively would be the easiest way to go about it Simply swap the left and right nodes, then recur...
Markdown supported · ⌘↵ to post
No responses yet.