Given a binary tree, you are asked to mirror it. βReadingβ it from left to right should turn into βreadingβ it from right to left.
Mirroring the binary tree in the image wonβt change anything, for instance. Do you know why π€?
Input
The input contains space-separated integers representing the values in the nodes of the binary tree. The order of the values is given by traversing from the left to the right subtree every time. A value of 0 means that the node does not exist. Itβs guaranteed that the input binary tree is valid.
Output
The program should print the pre-order traversal of the mirrored binary tree.