Why is CNOT the only non-trivial reversible gate for two input bits?
The CNOT gate is definitely not the only non-trivial reversible gate on two input bits. For example, you could switch the order of inputs or the order of outputs. What Wikipedia means is that CNOT is the only non-trivial reversible gate up to some allowed operations, which consist of permuting the inputs and outputs, and applying reversible one-bit gates on the inputs and outputs.
If a two-input gate $G$ is reversible, then it is a permutation on $00,01,10,11$. By possibly negating the inputs (or the outputs), we can assume that $G(00) = 00$. By possibly switching the order of the inputs, we can assume that in $G(01) &lt; G(10)$. We are left with three possibilities:
$$
00 \to 00 \quad 00 \to 00 \quad 00 \to 00 \\
01 \to 01 \quad 01 \to 01 \quad 01 \to 10 \\ 
10 \to 10 \quad 10 \to 11 \quad 10 \to 11 \\
11 \to 11 \quad 11 \to 10 \quad 11 \to 01
$$
The first possibility is the identity, which is trivial. The second possibility is CNOT. The third possibility is CNOT with outputs swapped.