Abstract:

The backtracking algorithm adopts the depth-first search strategy， and prunes when constraint condition dissatisfied， which is suitable for solving problems with large combinations. Two backtracking algorithms based on binary tree and variable length sub-tree are proposed to solve the set subsets， and the design of two algorithms uses compatibility technology， and pruning is not required in the search process. All set subsets can be solved. The time complexity of the two algorithms is ideal， and the operation efficiency of the algorithms is high. The complexity of the backtracking algorithm for solving set subsets based on variable length sub-tree is O （2n） ，and the algorithm efficiency is higher when the scale of problem solving increases.

Key words: font-family:", ">backtracking algorithmfont-family:宋体, ">, font-family:", "> binary treefont-family:宋体, ">, font-family:", "> variable length sub-tree