重载用于添加两个双链表的运算符

我需要帮助重载'+'运算符，以便将两个双链表添加在一起。由于出现"运算符=…不匹配"错误，我无法编译程序。我已经重载了"="运算符，但很难将添加的结果打印到std输出中。我还使<lt；操作人员几个小时以来，我一直试图找出问题所在，但没有成功。任何关于如何解决这个问题和/或解决方案的提示都是非常受欢迎的。这是我OOP课的作业。提前感谢！

编辑：代码背后的基本思想是复制集合。重载运算符"+"应作为并集，"*"应作为交集。我很难将并集正确打印到std输出。'+='看来效果不错<lt；'效果也很好，但只有在打印单个列表时。

编辑：编译器产生的错误（g++，从代码输出：：块，我删除了编译器注释）：

llist3.cpp|149|error: no match for ‘operator=’ (operand types are ‘LList’ and ‘LList’)|
llist3.cpp|106|note:   no known conversion for argument 1 from ‘LList’ to ‘LList&’|
llist3.cpp|151|error: no match for ‘operator=’ (operand types are ‘LList’ and ‘LList’)|
llist3.cpp|106|note:   no known conversion for argument 1 from ‘LList’ to ‘LList&’|
llist3.cpp|152|error: no match for ‘operator<<’ (operand types are ‘std::ostream {aka       std::basic_ostream<char>}’ and ‘LList’)|

   #include<iostream>
using namespace std;
class LList {
public:
    struct Node {
        int elem;
        Node* succ;
        Node* prev;
        Node() : succ(0), prev(0), elem(0) {}
    };
    LList();
    LList(LList& list);
    ~LList();
    Node* next();
    Node* begin()  { curr = head; }
    int getElem() { return curr->elem; }
    void addElem(int elem);
    LList operator+(LList& set);
    LList operator+(int elem);
    LList& operator+=(LList& set);
    LList& operator+=(int elem);
    LList& operator=(LList& list);
    friend ostream& operator<<(ostream& os, LList& obj);
 private:
    Node* curr;
    Node* head;
    Node* tail;
    int size;
    void pushFront(Node* n);
    void pushInside(Node* n);
    void pushBack(Node* n);
};
LList::LList() : head(0), tail(0), size(0), curr(0) {}
LList::LList(LList& list) : size(0), curr(0), head(0), tail(0) {
    list.curr = list.head;
    while(list.curr) {
        addElem(list.getElem());
        list.next();
    }
}
LList::Node* LList::next() {
    if (curr)
        return (curr = curr->succ);
    else
        return 0;
}
void LList::addElem(int elem) {
    Node* n = new Node;
    n->elem = elem;
    if (curr) {
        if (curr == head && elem < curr->elem) {
            pushFront(n);
        }
        else if (elem > curr->elem) {
            curr = curr->succ;
            addElem(elem);
        }
        else if (elem < curr->elem && elem > (curr->prev)->elem) {
            pushInside(n);
        }
        else if (elem < curr->elem) {
            curr = curr->prev;
            addElem(elem);
        }
    } else {
        pushBack(n);
    }
}
void LList::pushFront(Node* n) {
    head = n;
    n->succ = curr;
    curr->prev = n;
    n->prev = 0;
    curr = n;
    size++;
}
void LList::pushInside(Node* n) {
    (curr->prev)->succ = n;
    n->succ = curr;
    n->prev = curr->prev;
    curr->prev = n;
    size++;
}
void LList::pushBack(Node* n) {
    if (!head) {
        head = n;
    } else {
        tail->succ = n;
        n->prev = tail;
    }
    tail = n;
    curr = n;
    size++;
}
LList::~LList() {
    for (curr = head; curr;) {
        Node* temp = curr->succ;
        delete curr;
        curr = temp;
    }
}
LList& LList::operator=(LList& list) {
    list.begin();
    if (this != &list) {
        for (curr = head; curr;) {
            Node* temp = curr->succ;
            delete curr;
            curr = temp;
        }
        while (list.curr) {
            addElem(list.getElem());
            list.next();
        }
    }
    return *this;
}
ostream& operator<<(ostream& os, LList& list) {
    LList::Node* p = list.head;
    os << "{ ";
    while(p) {
        os << p->elem << (p->succ ? ", " : "");
        p = p->succ;
    }
    os << " }" << endl;
    return os;
}
LList LList::operator+(LList& set) {
    LList temp = *this;
    temp += set;
    return temp;
}
LList LList::operator+(int elem) {
    *this += elem;
    return *this;
}
int main() {
    LList setA;
    setA.addElem(1234);
    setA.addElem(1435);
    setA.addElem(1100);
    LList setB;
    setB.addElem(1234);
    setB.addElem(1435);
    setB.addElem(5100);
    setB = setA + 1234; // 1st error here
    LList setD;
    setD = setA + setB; //2nd
    cout << setA + setB << endl; //3rd
}