The trick is to show that $x^p$ is convex for $x\geq0$. Then when you replace $x$ with $|x|$, use the fact that composition of two convex functions(say f,g) with f nondecreasing is convex ($x^p$ is non decreasing for positive reals) . You dont have to worry about $x<0$ as the range of $|x|$ is the non-negative reals.
To prove $x^p$ is convex, for $p\geq2$, you can use the second derivative test. For p=1, it is linear. For $p \in (1,2)$, the first derivative yields $px^{p-1}$, which is monotonically increasing and hence, convex.