#include<iostream>
#include<cstddef>
using namespace std;
typedef int ItemType;
struct NodeType;
typedef NodeType *NodePtr;

struct NodeType {
ItemType component;
NodePtr link;
};

class List {
public:
List();
void Insert(ItemType item);
void Delete(ItemType item);
void ResetList();
ItemType GetNextItem();
int GetLength() const;
bool IsEmpty() const;
bool IsFull() const;
bool IsThere(ItemType item) const;
bool HasNext() const;
void clean();

List split_ver1(ItemType item) {
   List ll;
   NodePtr ptr = lastPtr;
   /**
      * One method called split_ver1 splits the given
      * list at a node containing given item.
      * The nodes from the beginning to the node before the node
      * containing the given item will be in the first part of the list.
      * The remaining nodes will be in the second
      * part of the list. In this version the splitting is
      * done by repeatedly using delete and insert operations as
      * explained in the class.
      */
   // try to cut the last item in the current list
   // and add it to the new list
   while (ptr != NULL
            && ptr->component >= item) {
         ll.Insert(ptr->component);
         this->Delete(ptr->component);
         ptr = lastPtr;
   }

   return ll;
}

List split_ver2(ItemType item) {
   List ll;

   /**
      * The method split_ver2 splits the list without using any
      * deletion or insertion of
      * nodes. It simply manipulates pointer to create two
      * lists as explained in the class.
      */
   NodePtr ptr = dataPtr;
   NodePtr prev = NULL;
   while (ptr != NULL
            && ptr->component < item) {
         prev = ptr;
         ptr = ptr->link;
   }

   // all item in the list are less than item
   // or the list is empty
   if (ptr == NULL) {
         return ll;
   }

   // move all item of current list to the new one
   if (prev == NULL) {
         ll.dataPtr = this->dataPtr;
         ll.lastPtr = this->lastPtr;
         ll.length = this->length;
         ll.currentPos = ll.dataPtr;

         dataPtr = NULL;
         currentPos = dataPtr;
         length = 0;
         lastPtr = NULL;

   } else { // cut a part of the list to he new list
         //set the new list
         ll.dataPtr = ptr;
         ll.lastPtr = this->lastPtr;
         ll.currentPos = ll.dataPtr;

         // find the length of this node
         int counter = 0;
         while (ptr != NULL) {
            counter++;
            ptr = ptr->link;
         }

Incorporate mapping Bing maps and Google maps into one application...