The lack of infrastructure and dynamic nature of mobile ad hoc networks demand new networking strategies to be implemented in order to provide efficient end-to-end communication. Some researches have been proposed to organize the network into groups called clusters and use different routing protocols for inter and intra clusters to propagate an information. But with these solutions, the network first needs to be organized into cluster and next, we need to construct each routing table. Other researchers have been proposed to build a spanning tree on the network to forward informations on a tree but many solutions need to know the global network topology. In this paper, we propose a self-stabilizing algorithm both to construct cluster and simultaneously build a spanning tree on the network. Without any global knowledge, we use only one type of periodically exchanged messages of size Log(5n+3) bits and we construct clusters and the spanning tree on the network.