The invention provides a Trie searching method applied to a network processor. The Trie searching method applied to the network processor is characterized by comprising the following steps that firstly, a multi-level storage structure is established, wherein the storage structure comprises a register file, an internal RAM, an external SRAM and an external SDRAM, and the priority of the register file, the priority of the internal RAM, the priority of the external SRAM and the priority of the external SDRAM are gradually reduced; secondly, a balance tree is established, wherein each bit of all routing tables is traversed, the bit of which the number of values 0 and the number of values 1 are roughly equal is found, set as a current root node and marked as a used bit, the process is repeated, and the relative balance tree is established; thirdly, data storage is conducted, wherein every time data storage is conducted, a plurality of adjacent bits of data are organized into a sub-tree structure to conduct data storage. The hierarchical storage structure is adopted for the Trie structure, the time for a key to have access to the external memories is shortened, and high searching speed is obtained at low memory cost.