给出一个单词和这个单词的每个字母的数字，如何创建每种组合的完整树？

def create_combinations(word, digits):
    if len(digits) == 0:
        return [word]
    
    combinations = []
    for digit in digits:
        new_word = word + digit
        remaining_digits = digits.replace(digit, '', 1)
        sub_combinations = create_combinations(new_word, remaining_digits)
        combinations.extend(sub_combinations)
    
    return combinations

word = input("请输入一个单词：")
digits = input("请输入每个字母的数字：")
combinations = create_combinations("", digits)
print("所有组合：", combinations)