Hot moo shuffle: milk an array Background
Milking the deck is the name given to the following card shuffling method:

'Pinch' the deck to remove the top and bottom cards simultaneously. (With lots of imagination, this action resembles milking a cow.) This pair of cards forms the base of a new pile.
Repeat, adding each pair of cards to the top of the new pile, until the whole deck has been used.

Example
Suppose we start with a deck of six cards, [1, 2, 3, 4, 5, 6] (lower-indexed elements are nearer to the top). Let's milk the deck:

old = [1, 2, 3, 4, 5, 6], new = []
Remove [1, 6]: old = [2, 3, 4, 5], new = [1, 6]
Remove [2, 5]: old = [3, 4], new = [2, 5, 1, 6]
Remove [3, 4]: old = [], new = [3, 4, 2, 5, 1, 6]

After milking, the deck is therefore ordered [3, 4, 2, 5, 1, 6].
Challenge
Your task in this code-golf challenge is to implement the milking operation on a given array and output/return the result. The input array will contain only positive integers, not necessarily distinct. If the input array contains an odd number of elements, then the last milking step transfers only one element (the last one remaining) from the input to the output array.
Test cases
Input -&gt; Output
[1, 2, 3, 4, 5, 6] -&gt; [3, 4, 2, 5, 1, 6]
[1, 2, 3, 4, 5, 6, 7] -&gt; [4, 3, 5, 2, 6, 1, 7]
[9, 7, 5, 3, 1, 2, 4, 6, 8, 10] -&gt; [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
[1, 1, 2, 1, 2] -&gt; [2, 1, 1, 1, 2]
[] -&gt; []
R, 53 50 48 bytes

f=function(x,y=rev(x))if(c(y,F))c(f(y[-1]),y[1])

Try it online!
Repeatedly takes the bottom card &amp; flips the deck.