C++组合模式怎样处理树形结构 统一叶子与容器的操作接口

#include <iostream>
#include <vector>

class Component {
public:
    virtual void operation() = 0;
    virtual void add(Component* component) {} // 默认实现，叶子节点不支持添加
    virtual void remove(Component* component) {} // 默认实现，叶子节点不支持删除
    virtual Component* getChild(int index) { return nullptr; } // 默认实现，叶子节点没有子节点
    virtual ~Component() {}
};

class Leaf : public Component {
public:
    void operation() override {
        std::cout << "Leaf operation" << std::endl;
    }
};

class Composite : public Component {
private:
    std::vector<Component*> children;

public:
    void operation() override {
        std::cout << "Composite operation" << std::endl;
        for (Component* child : children) {
            child->operation();
        }
    }

    void add(Component* component) override {
        children.push_back(component);
    }

    void remove(Component* component) override {
        // 移除子组件的逻辑，这里简化了
        for (size_t i = 0; i < children.size(); ++i) {
            if (children[i] == component) {
                children.erase(children.begin() + i);
                break;
            }
        }
    }

    Component* getChild(int index) override {
        if (index >= 0 && index < children.size()) {
            return children[index];
        }
        return nullptr;
    }

    ~Composite() {
        for (Component* child : children) {
            delete child;
        }
    }
};

int main() {
    Composite* root = new Composite();
    Leaf* leaf1 = new Leaf();
    Leaf* leaf2 = new Leaf();
    Composite* composite1 = new Composite();
    Leaf* leaf3 = new Leaf();

    root->add(leaf1);
    root->add(composite1);
    composite1->add(leaf2);
    composite1->add(leaf3);

    root->operation(); // 执行整个树的操作

    delete root; // 注意释放内存
    return 0;
}