Skip to content

Latest commit

 

History

History

challenge_4

Invert Binary Tree

Premise

for example, say you have a tree that looks like the following

tree

after your program runs, it should return a tree that looks like this

reversedTree

  • Your program should run on any size tree. What is the runtime and space of your algorithm? Do you think it's reasonable? These are important questions you should ask yourself when creating these types of solutions.

Testing

There is no automated testing for this challenge.