Wireless sensor networks consist of hundreds to thousands of low power multi functioning sensor nodes. It operates in an unattended environment with limited computational and sensing capabilities. A wireless sensor network is constructed based on a cluster tree. Isolated node with the maximum number of neighbor isolated nodes that launch the cluster generation process. Therefore, the total amount of cluster heads is minimizing. In the cluster tree creation algorithm, the cluster tree architecture is projected and it minimizes the entire number of nodes included in a cluster tree hence, the routing cost is reduced. In the cluster tree repair algorithm, while a cluster head or a cluster associate node fails or move out of communication range of router, a new cluster head or cluster associate node is elected to maintain the cluster tree topology. The cluster tree repair algorithm doesn’t consider the non uniform node distribution. In order to elect cluster heads with higher energy, the parameter of cluster head competition in EADC and EADUC is based on the ratio between the average residual energy of neighbor nodes and the residual energy of the node itself. The aim is to improve load balance among cluster heads, energy consumption and improve the network life time significantly among uniform and non uniform node distribution.