$0000000$ algorithm Cover$($tree$)($pre$-$cond$)$: tree is a binary tree in which each node is labeled either zero or one. $($post$-$cond$)$: The output is the node C of the tree that is the furthest away from the root such that the subtree rooted at C contains all the nodes labeled one. $($This node in the example is circled.$)$ If the tree contains no nodes labeled one, then C $=$ nullpointer. begin