class BinaryTree {
 Node *root;

 void insert(Node **node, int data) 
 {
  if (  *node == NULL ) 
   *node = new Node(data);
  else {
   if ( data <= (*node)->data )
    insert(&((*node)->left),data);
   else
    insert(&((*node)->right),data);
  }
 }

 public:
 BinaryTree() : root(NULL) { }
 void insert(int data) 
 {
  insert(&root,data);
 }


 void levelorder() {
  std::queue levelq;

  levelq.push(root);
  while( levelq.size() > 0 ) {
   Node *cur = levelq.front();
   std::cout << cur->data << "  ";
   levelq.pop();
   if (cur->left)  levelq.push(cur->left);
   if (cur->right) levelq.push(cur->right);
  }
 }
};

/* Function which removes Loop from LL */

void vRemoveLoop(Node *head1)
{
    Node *tmp;
    Node *tmp1 = NULL;
    for(tmp = head1; tmp!= NULL; tmp = tmp1) {
 Node *temp = (Node *) malloc(sizeof(Node));
 temp->data = (int) temp;
 temp->next = NULL;
 if( (tmp->next != tmp) && (tmp->next->next->data !=  (int) tmp->next->next) ) 
         temp->next = tmp->next;
     tmp->next = temp;
            tmp1 = temp->next;
    }

    for(tmp = head1; tmp!= NULL; tmp = tmp->next) {
        tmp1 = tmp->next;
        tmp->next = tmp->next->next;
        if (tmp1->next != NULL ) 
            tmp1->next = tmp1->next->next;
        else
            tmp1->next = NULL;
    }
}

struct NODE {
    bool returnValue;
    struct NODE *next;
} MOD3_LOOP[3];

bool DivBy3(int n)
{
    MOD3_LOOP[0].returnValue = TRUE;
    MOD3_LOOP[0].next = &MOD3_LOOP[1];

    MOD3_LOOP[1].returnValue = FALSE;
    MOD3_LOOP[1].next = &MOD3_LOOP[2];

    MOD3_LOOP[2].returnValue = FALSE;
    MOD3_LOOP[2].next = &MOD3_LOOP[0];

    NODE *iterator = &MOD3_LOOP[0];
    int val = n;

    while(val != 0) {
        for (int i = 0; i < (val & 0x03); i++)
            iter = iter->next;
        val = val>>2;
    }

    return (iter->returnValue);
}

int div3(int number)
{
 if ( number < 0 ) number = -number;
 while ( number > 2 ) {
   unsigned int odd  = number & 0xaaaaaaaa;  
   unsigned int even  = number & 0x55555555;  
   int count = 0;
   while(odd) {
     odd &= (odd-1);
     count++;
   }
   while(even) {
     even &= (even-1);
     count--;
   }
   if ( count < 0 ) count = -count;
   number = count;
 }
 return (number == 0);
}

#include < iostream >
#define ARRAY 2,1,3,4,2,3,4,5,6,7,1
using namespace std;

typedef struct NODE {
    int data;
    struct NODE *next;
    struct NODE *arb;
} Node;


Node *head1 = NULL;
Node *head2 = NULL;

/* Create a Link List which has to be copied */
void vCreateLL(Node **head)
{
    int nArb[] = { ARRAY };
    Node *temp = NULL;
    int i;

    /* Creating LL and filling data element */
    for(i = 0; i < sizeof(nArb)/sizeof(nArb[0]); i++ ) {
        Node *tmp = (Node *) malloc(sizeof(Node));
        tmp->data = rand() % 10;
        tmp->arb = NULL;
        tmp->next = NULL;
        if(*head == NULL ) *head = tmp;
        else temp->next = tmp;
        temp = tmp;
    }

    /* Filling up arb with node location given in an array nArb */
    temp = *head;
    for(i = 0; i < sizeof(nArb)/sizeof(nArb[0]); i++ ) {
        Node *tmp = *head;
        for(int j = 0; j < nArb[i]; j++ ) {
            tmp = tmp->next;
            if ( tmp == NULL)
                tmp = *head;
        }
        temp->arb = tmp;
        temp = temp->next;
    }
}

/* Print the LL along with node pointed by arb */
void vPrintLL(Node *head)
{
    for(Node *tmp = head; tmp != NULL; tmp = tmp->next) {
        printf("[ %d->%d ] ",tmp->data,tmp->arb->data);
    }
    printf("\n");
}

/* Copy Function which copies the LL 
 *which starts with head1 to head2 
 */

void vCopyLL(Node *head1,Node**head2)
{
    Node *tmp;
    Node *tmp1 = NULL;
    for(tmp = head1; tmp!= NULL; tmp = tmp1) {
        Node *temp = (Node *) malloc(sizeof(Node));
        temp->data = tmp->data;
        temp->arb = NULL;
        temp->next = tmp->next;
        tmp->next = temp;
        tmp1 = temp->next;
        if ( *head2 == NULL )
            *head2 = temp;
    }

    for(tmp = head1; tmp!= NULL; tmp = tmp->next->next) 
        tmp->next->arb = tmp->arb->next;

    for(tmp = head1; tmp!= NULL; tmp = tmp->next) {
        tmp1 = tmp->next;
        tmp->next = tmp->next->next;
        if (tmp1->next != NULL ) 
            tmp1->next = tmp1->next->next;
        else
            tmp1->next = NULL;
    }
}

int main()
{
    vCreateLL(&head1);
    vPrintLL(head1);

    vCopyLL(head1,&head2);
    vPrintLL(head2);
    return 0;
}

/* returns 1, if number is prime else 0 */
int prime(int number)
{
    int iter,bound;
    if (!(number % 2)) return (number == 2);
    if (!(number % 3)) return (number == 3);
    if (!(number % 5)) return (number == 5);
    for(iter = 7; (iter * iter)<= number; iter += 2)
        if ( number % iter == 0 ) return 0;
    return 1;
}

3   = 0000000011
10 = 0000001010