Design a data structure for binary trees, and write the following functions on binary trees in Picat, Haskell$\mathrm{.}2.$ deepest$($tree$)$: This function returns the value in a deepest node in tree. If there are multiple such values, then the function returns the left$-$most one.