One-sided algebraic structures, like near-rings, near-fields, and seminear-rings do have a number of applications in computer science. These applications include rooted trees. With naturallly defined addisitons and multiplications of rooted trees, these trees form a seminear-ring. A number of graph-theoretical questions can be turned into questions on seminear-rings and near-rings. Also, applications of near-rings to combinatorics via balanced incomplete block designs, are discussed.