It is not complete.

It always expands the lowest-code node.

A variant of the uniform-cost search is Dijkstra's algorithm (the basic algorithm is essentially the same).

It is optimal if nodes expand in increasing order of g(n).