如何按字母顺序对JSON树进行完全排序

import json

def sort_json_tree(json_tree):
    # 解析JSON树
    tree = json.loads(json_tree)

    # 遍历JSON树
    key_value_pairs = get_key_value_pairs(tree)

    # 排序键值对
    sorted_pairs = sorted(key_value_pairs, key=lambda x: x[0])

    # 重构JSON树
    sorted_tree = reconstruct_json_tree(sorted_pairs)

    return json.dumps(sorted_tree)

def get_key_value_pairs(tree):
    pairs = []
    if isinstance(tree, dict):
        for key, value in tree.items():
            pairs.append((key, get_key_value_pairs(value)))
    elif isinstance(tree, list):
        for value in tree:
            pairs.append(get_key_value_pairs(value))
    else:
        pairs.append(tree)
    return pairs

def reconstruct_json_tree(pairs):
    tree = {}
    for pair in pairs:
        if isinstance(pair, tuple):
            key, value = pair
            tree[key] = reconstruct_json_tree(value)
        else:
            tree = pair
    return tree

# 测试
json_tree = '{"b": 2, "a": {"c": 3}, "d": [4, 5, 6]}'
sorted_json_tree = sort_json_tree(json_tree)
print(sorted_json_tree)