readMe.md

Given a binary tree, the task is to flip the binary tree towards right direction that is clockwise.

In the flip operation, left most node becomes the root of flipped tree and its parent become its right child and the right sibling become its left child and same should be done for all left most nodes recursively.