Suppose that you are given a binary tree T with vertices V and edges E$,$

in adjacency list format. Assume that there is a designated root node x$.$ For

two nodes u$,$ v in V $,$ u is an ancestor of v if the path from the root x to v

passes through u$.$ If u is an ancestor of v$,$ then v is said to be a descendant

of u