A root system can be considered as an example of a rack (which is a bit more general than a quandle). Namely, one defines the Coxeter rack $C$ as the Euclidean space $V$ together with an operation $u*v = s_v(u)$, the reflection of $u$ with respect to $v^\perp$. Then a root system (as a subset of $V$) can be considered as a finite subrack of $C$.
Some sources claim that root systems can be defined precisely as the finite subracks of the Coxeter rack. However, if $\Phi$ is a root system with roots of two distict lengths, say, short of length $x$ and long of length $y\neq x$, then scaling all long roots by some arbitrary constant $\lambda$ produces another finite subrack, which is no longer a root system. There are two possible ways to deal with this:
- Consider these finite subrack of $C$ up to isomorphisms and forget about the particular embedding. This way you can no longer distinguish between the root system and its dual, namely, $B_n$ and $C_n$ type root systems become isomorphic as racks.
- Equip the embedding $\Phi\subset V$ with some additional structure which allows to reconstruct the lengths ratio. But none of the standard extensions (such as augmented quandles) seem to be natural for this goal. It is possible, I would guess, but certainly not easier than the standard definition of a root system.
One can define a quandle similar to the Coxeter rack $C$ as $V$ together with the operation $u*v=-s_v(u)$, but the same considerations apply.
So while a root system can be considered as an example of a rack or a quandle, this languages does not, apparently, provide an easier way to define them.