 
 			return new Pow(left, right)
 
-		sorted: ->
-			# Sort and return this node.
-			# Numbers first, then letters, in numerical and alphabetical order.
-			# Then power nodes, in order of the base.
-			# Then addition nodes, in order of their first child.
+		sort: ->
+			# Sort this node.
+			for child in @children
+				children.sort?()
+			@children.sort(compare)
 
 	class Pow extends nodes.BinaryNode
 		# Represent powers.

				(if @children.left.copy? then @children.left.copy() else @children.left),
				(if @children.right.copy? then @children.right.copy() else @children.right)
			)

		compareSameType: (b) ->
			# Compare this object with another of the same type.

					children.push(child)

			return new Add(children...)

		sort: ->
			# Sort this node.
			for child in @children
				children.sort?()
			@children.sort(compare)

	class Mul extends nodes.RoseNode
		# Represent multiplication.
