An optimal scheduling structure for data aggregation in wireless sensor networks is proposed.The paper evaluates this scheduling policy with different-weight based binary tree networks.The analysis and experiments indicate that the total delay in whole network can be efficiently decreased by using this scheduling policy,especially when the number of binary nodes in the experiment equals to 25,the result approaches the most optimal line.Unfortunately,this scheduling cannot maintain stability when network scale improves rapidly.