Your Challenge is to take a binary string as input and get all binary numbers between itself and the reverse of its string representation (the reverse may be less than or greater than the original input).
Output must be padded with zeroes to be the same length as the input.
The Order in which the values are displayed doesn't matter, but the Code needs to work with Values that are bigger than its reverse.
Input: (1 or 0) Output: None, string and its reverse are identical Input: (any palindrome binary) Output: None, same as above Input: 01 Output: None, since there is no binary between 01 and 10 (1 and 2) Input: 001 Output: 010,011 (Numbers between 001 (1) and 100 (4): 2,3) Input: 100 Output: 010,011 (Same as above) Input: 0010 Output: 0011 (Numbers between 0010 (2) and 0100 (4): 3)
This is Code Golf, shortest code wins!
EDIT: After seeing some of the solutions i have removed the requirement of the number representation of the binary being in ascending order. This is my first code golf challenge and i don't want to make it to tedious, also added some clarifications from the comments.