The minimum spanning tree clustering algorithm is capable of detecting clusters with irregular boundaries. In this paper we propose minimum spanning tree based clustering algorithm. The algorithm produces k clusters with Minimum Spanning Clustering Tree (MSCT), a new data structure which can be used as search tree. Our algorithm works in two phases. The first phase produces subtree (cluster). The second phase converts the subtree into binary tree called MSCT.