在运行时递归遍历Python继承树

class A:
    def __init__(self):
        self.a = 1

class B(A):
    def __init__(self):
        super().__init__()
        self.b = 2

class C(B):
    def __init__(self):
        super().__init__()
        self.c = 3

def traverse_inheritance_tree(obj):
    if obj.__class__.__base__ is not object:
        traverse_inheritance_tree(obj.__class__.__base__)
    for attr in obj.__class__.__dict__:
        if not hasattr(obj, attr):
            print(f"{obj.__class__.__name__}.{attr}")

c = C()
traverse_inheritance_tree(c)

B.b
A.a