Existing treemap layout algorithms are inefficient sequentially, while ordered treemap layout algorithms are incapable of squarifying ability and providing continuity. In this paper, we propose a type of ordered treemap of weight divided layout algorithm. The overall idea of the algorithm is to bundle multiple nodes into two nodes with similar weights. Then, the long edge segmentation principle is used to design the rectangular area of the treemap. Through the application of the “divide and conquer” rule for the new structure of the two power value nodes, the layouts of all the single nodes are accomplished by repeating the above process until completion. We used 50 randomly generated datasets and compared nine types of layout algorithms. The comparison and analysis are made with six indexes for our algorithm. The experimental results show that the algorithm has an advantage in terms of average aspect ratio, continuity, and distance correlation, and that it is suitable for a hierarchical data visualization display that has order requirements.