Descendant of a vertex v, in the tree data structure, refers to a vertex that is either a child of v or recursively a descendant of any of the children of v.
A tree, in graph theory, is an undirected graph which has a unique path between any pair of vertices. A tree is called rooted, if one particular vertex is assigned as the root.
A rooted tree induces a partial order, where the root is at the highest level, each vertex connected to the root via an edge are called its children. This hierarchy may continue further down, with each vertex having children of its own.
A descendant of any vertex is, therefore, any vertex that can be reached by traversing from parent to child.