I'll find an eigenvector corresponding to $\lambda = 0$. We want to find a vector $v = \left [ \begin{array}{ccc}
v_1 & v_2 & v_3 \\
\end{array} \right ]^T$ such that
$$
\left [ \begin{array}{ccc}
0 & 1 -i & 0 \\
1 + i & 0 & 1 - i \\
0 & 1+i & 0 \\
\end{array} \right ] \left [ \begin{array}{c}
v_1\\
v_2\\
v_3\\
\end{array} \right ] \;\; =\;\; \textbf{0}_{3\times 3}.
$$
It should be clear from multiplication that $v_2 = 0$. The only other constraint is $(1+i)v_1 = (1-i)v_3$ or rather
$$
v_1 \;\; = \;\; \frac{1-i}{1+i} v_3 \;\; =\;\; \frac{1-i}{1+i}\cdot \frac{1-i}{1-i}v_3 \;\; =\;\; \frac{-2i}{2} v_3
$$
Or $v_1 = -iv_3$. The technique used above can always be used to get rid of complex numbers in the denominator of a fraction. Take $v_3 = 1$ and we have
$$
v \;\; =\;\; \left [ \begin{array}{c}
-i \\
0 \\
1 \\
\end{array} \right]
$$
Is one of the eigenvectors. The others can be found similarly, except you need to compute $(A - \lambda I)w=0$ where $A$ is the matrix given, $\lambda$ is an eigenvalue, and $w$ is a proposed eigenvector.