求问L家的一道Deep iterator的题

Program an iterator for a Linked List which may include nodes which are nested within other nodes. i.e. (1)->(2)->(3(4))->((5)(6). Iterator returns 1->2->3->4->5->6

接口得给一个吧

// 不会java  按我的想法用C++试试，code里面还有很多需要修改的地方，  希望对你有用。

struct Node
{
    int data;
    Node *next;
    vector<Node*> nested;
};

struct Iterator
{
    Node *cur;
    int indexNest;

    Iterator(Node *_cur)
    {
      cur = _cur;
      indexNest = 0;
    }

    Iterator &operator ++()
    {
      if (cur->nested.size() == indexNest){
        cur = cur->next;
        indexNest = 0;
      }
      else
        cur = cur->nested[indexNest++];
      return this;
    }
};