A method for implementing multi-protection overlapped protection groups, comprising: Step A: constructing M binary trees from multiple protection groups in a network according to their respective types, each protection group comprising a primary tunnel and a backup tunnel, wherein each binary tree has a unique primary tunnel, a first side node of the binary tree includes a primary tunnel at a bottom level and protection groups of the binary tree, and a second side node includes backup tunnels of the protection groups of the binary tree; Step B: traversing the M binary trees to find out two binary trees in which a primary tunnel of one of the two binary trees is the same as a backup tunnel of the other of the two binary trees, performing each binary tree adjustment by using a root node of the binary tree in which the primary tunnel is located to replace the backup tunnel of the other binary tree; Step C: performing the binary tree adjustment for, M-1, times; wherein the protection groups having the same primary tunnel are classified into a type; wherein in Step A, generating each binary tree includes: constructing N binary tree units from N protection groups having a same primary tunnel, wherein a root node of each binary tree unit is a protection group, a first side node is a primary tunnel of the protection group and a second side node is a backup tunnel of the protection group; setting priorities of the N protection groups from lowest to highest as 1,2......N and performing binary tree unit combination for, N-1, times; and during each binary tree unit combination, replacing a primary tunnel of a binary tree of which priority is, N-1, with a root node of a binary tree unit of which priority is N. Step A: constructing M binary trees from multiple protection groups in a network according to their respective types, each protection group comprising a primary tunnel and a backup tunnel, wherein each binary tree has a unique primary tunnel, a first side node of the binary tree includes a primary tunnel at a bottom level and protection groups of the binary tree, and a second side node includes backup tunnels of the protection groups of the binary tree; Step B: traversing the M binary trees to find out two binary trees in which a primary tunnel of one of the two binary trees is the same as a backup tunnel of the other of the two binary trees, performing each binary tree adjustment by using a root node of the binary tree in which the primary tunnel is located to replace the backup tunnel of the other binary tree; Step C: performing the binary tree adjustment for, M-1, times; constructing N binary tree units from N protection groups having a same primary tunnel, wherein a root node of each binary tree unit is a protection group, a first side node is a primary tunnel of the protection group and a second side node is a backup tunnel of the protection group; setting priorities of the N protection groups from lowest to highest as 1,2......N and performing binary tree unit combination for, N-1, times; and during each binary tree unit combination, replacing a primary tunnel of a binary tree of which priority is, N-1, with a root node of a binary tree unit of which priority is N.