What do we benefit from using ternary search trees rather than binary search trees?
I'd challenge you to write the code which queries your data structure. For example, how could you determine that "SARAS" is in your tree, but "KSARAS" is not?

The problem with your data structure is that we cannot tell the difference between searching and selecting a letter. This is what the middle child of the ternary tree is used for: when you've found the letter you're looking for, you step to its middle child.

Here's what a ternary tree for your set of words might look like. I've marked word ends with *.

    K
    | \
    A  S
    |  |
    R  A
    |  |
    I  R
  / |  |
 A  M* A
 |     |
 S*    S*


Querying for "SARAS", for example, would look like this:


[Looking for "SARAS", at node K] S > K, so go right.
[Looking for "SARAS", at node S] S = S, so go down and advance to next character.
[Looking for "ARAS", at node A] A = A, so go down and advance to next character.
etc... (eventually returns true)


Querying for "KSARAS", however, would look like this:


[Looking for "KSARAS", at node K] K = K, so go down and advance to next character.
[Looking for "SARAS", at node A] S > A, so go right.
[Looking for "SARAS", fell off tree] return false.