Nowadays, FPGA Placement problems have become more complicated since they need to account area constraint and time constraint. Placement is still one of the most difficult problems as the FPGA designs become larger and more complex. As FPGAs are programmable in nature they are an ideal fit for many different markets such as Aerospace, Defense, Audio, Automotive, Broadcast, Industrial, Medical, Security, Video Image Processing, Wired Wireless communications. Also, FPGA is becoming popular among big companies and researchers who apply FPGA to highperformance computing and deep learning as it provides better performance, flexible programmability, better cost, etc. In this paper, we present a Tree-based placement algorithm for Homogeneous FPGAs. By applying our algorithm on a set of benchmark circuits we have effectively reduced the placement cost. We have compared results with VPR that uses Simulated annealing approach and our results are comparatively better. © 2018 IEEE.