Suffix tree and Tries. What is the difference?

Question

I am reading about Tries commonly known as Prefix trees and Suffix Trees.
Although I have found code for a Trie I can not find an

Answer 1

The difference is very simple. A suffix tree has less "dummy" nodes than the suffix trie. These dummy nodes are single characters that increase the lookup operation at the tree