Mode of a ternary search tree

In this tree each node has up to three children: the left subtree holds smaller values, the middle child equals the node's value, and the right subtree holds larger values. Return the most frequent value. Use the structure to count runs of equal values, cover the edge cases, and discuss what to do if the tree breaks the ordering rules.