DATA structures We are given a complete binary tree with height h and n nodes. The link between a node and its left child is labeled as 0 and the link between a node and its right child is labeled as 1 . A path from the root to each external node at the last level can be labeled by an h-tuple (x1,x2,,xh) of 1s and 0 s that lie on its links. See the following example: We are given an h-tuple (x1,x2,,xh) of 0 s and 1s. In logarithmic time, test if a node assigned to this tuple is the right-most deepest external node or not. Example: in the given tree: Input:(1,0,0) output: No Input: (1,0,1) output: Yes.