Ternary search tree implementation in python 3
Data structure-wise, it seems okay, and does what you're after.

Code-style wise, I see a few things:


It's not quite PEP8, the coding style. Whilst you can read it, which is always good, there are tools to automatize the process, such as flake8, black. Most likely, your editor will have a plugin. 

This is include things like underscore_names in lieu of camelCasing.

Note that this standard is a living document, and gets updated once in a while.
None is a singleton in Python, and thus you can use the is keyword instead.
Python relies on its id() function to get a hash of an object, and compare them.
As None is a singleton, the hash is the same. 

So your line if node == None: could be if node is None.
Going further this way, None evaluates to False in a test, so you could go if not node: (edit: as discussed with @Gloweye, it's indeed clearer and preferred to use the first variant).
Python returns None when no value is being explicitly returned, whether you have no return in a function, or do a blank return.


These two lines taken together could then be:

if node is None:
    return


and would be considered idiomatic.


Lastly, in Python3 (which you ought to be using), class definition have been revamped. The way you do it:


class TST(object):


is now:

class TST:


If you were inheriting from something, though, it would indeed be:

class TST(ParentClass):


Maybe what you could try next is to implement unit tests with unittest or pytest and see whether your structure holds on with more convoluted cases.