This is the wrong question

  • 0

    follow the tweets, what he meant is "min-max","descending to ascending", although i still don't know what he's talking.

  • 0

    just invert the binary tree...
    eg. the left child always bigger than the right child in the original tree, so you have to invert the original tree to get the left child smaller than the right child. As it says "descending to ascending". :)

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.