← Questions
Mode of a ternary search tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding