Introduced a decade ago by Berthé et al., dendric sequences include codings of regular interval exchange transformations and strict episturmian (or Arnoux-Rauzy) sequences, two majorly studied generalizations of Sturmian sequences. Dendricity is defined by looking at all finite factors and restricting the behavior of surrounding letters. This induces combinatorial restrictions such as affine factor complexity. In this course, we introduce dendric sequences and survey their properties with respect to return words.