{ Renata Lara }
{ CSCI 3333.01 }
{ March 3, 1998 }

{ This program implements an AVL tree which inserts(and balances),         }
{ deletes(and balances), finds, and prints elements in alphabetical order. }

{ ************************************************************************ }

{ PROCEDURE create_tree(var T : TreePtr);                                  }
{ Function: will initialize tree to an empty state                         }
{ Precondition: tree does not already exists                               }
{ Postcondition: tree has been created and is empty                        }
{ Run Time: O(1)                                                           }    

{ ************************************************************************ }

{ PROCEDURE destroy_tree(var T : TreePtr);                                 }
{ Function: will initialize tree to an empty state                         }
{ Precondition: tree already exists                                        }
{ Postcondition: tree has been destroyed and is empty                      }
{ Run Time: O(1)                                                           }    

{ ************************************************************************ }

{ PROCEDURE left_rotation(var T : TreePtr);                                }
{ Function: performs a rotation between a node and its left child          }
{ Precondition: tree exists and is not empty; this procedure is only called
                if an insertion is made into the left subtree of the left
                child of 'alpha'                                           }
{ Postcondition: balanced tree with height of not more than 1 in difference
                 between subtrees                                          }
{ Run Time: O(1)                                                           }

{ ************************************************************************ }

{ PROCEDURE right_rotation(var T : TreePtr);                               }
{ Function: performs a rotation between a node and its right child         }
{ Precondition: tree exists and is not empty; this procedure is only called
                if an insertion is made into the right subtree of the right
                child of 'alpha'                                           }
{ Postcondition: balanced tree with height of not more than 1 in difference
                 between subtrees                                          }
{ Run Time: O(1)                                                           }

{ ************************************************************************ }

{ PROCEDURE double_left(var T : TreePtr);                                  }
{ Function: performs a rotation to the right and then to the left          }
{ Precondition: tree exists and is not empty; this procedure is only called
                if an insertion is made into a node which has a left child,
                and that left child has a right child.                     }
{ Postcondition: balanced tree with height of not more than 1 in difference
                 between subtrees                                          }
{ Run Time: O(1)                                                           }

{ ************************************************************************ }

{ PROCEDURE double_right(var T : TreePtr);                                 }
{ Function: performs a rotation to the left and then to the right          }
{ Precondition: tree exists and is not empty; this procedure is only called
                if an insertion is made into a node which has a right child,
                and that right child has a left child.                     }
{ Postcondition: balanced tree with height of not more than 1 in difference
                 between subtrees                                          }
{ Run Time: O(1)                                                           }

{ ************************************************************************ }

{ PROCEDURE insert(var T : TreePtr; K : keyType; var val : boolean);       }
{ Function: inserts a new element in the tree                              }
{ Precondition: tree exists and is not full                                }
{ Postcondition: blanced tree with new element added                       }
{ Run Time: O(log N)                                                       }

{ ************************************************************************ }

{ PROCEDURE delete(var T : TreePtr; K : keyType; var val : boolean);       }
{ Function: deletes an element from the tree                               }
{ Precondition: tree exists and is not empty                               }
{ Postcondition: balanced tree with the element deleted                    }
{ Run Time: O(log N)                                                       }

{ ************************************************************************ }

{ PROCEDURE find(T:TreePtr; element : KeyType);                            }
{ Function: finds an element in the tree and displays its information      }
{ Precondition: Tree exists and is not empty                               }
{ Postcondition: if element found, the information is printed              }
{ Run Time: O(log N)                                                       }

{ ************************************************************************ }

{ PROCEDURE preprint(T:TreePtr);                                           }
{ Function: prints tree in pre-order traversal                             }
{ Precondition: tree exists and is not empty                               }
{ Postcondition: tree has been printed in pre-order                        }
{ Run Time: O(N)                                                           }

{ ************************************************************************ }

{ PROCEDURE print(T:TreePtr);                                              }
{ Function: prints tree in alphabetical order                              }
{ Precondition: tree exists                                                }
{ Postcondition: tree has been printed in alphabetical order               }
{ Run Time: O(N)                                                           }

{ ************************************************************************ }

{ PROCEDURE postprint(T:TreePtr);                                          }
{ Function: prints tree in post-order traversal                            }
{ Precondition: tree exists and is not empty                               }
{ Postcondition: tree has been printed in post-order                       }
{ Run Time: O(N)                                                           }

{ ************************************************************************ }

PROGRAM AVLtree;

USES help1380;

TYPE

elementType = string;

KeyType = RECORD
  name : elementType;
  zip  : elementType;
 END;

TreePtr = ^TreeNode;

TreeNode = RECORD
  key : KeyType;
  left    : TreePtr;
  right   : TreePtr;
  height  : -1..+1         { height = h(right) - h(left) }
END;

VAR

Tree     : TreePtr;
value    : boolean;        { for insertion & deletion }
menuchar : char;           { loop control }
info     : KeyType;

PROCEDURE create_tree(var T : TreePtr);
BEGIN
  T := NIL;
END;

PROCEDURE destroy_tree(var T: TreePtr);
BEGIN
  T:=NIL;
END;

PROCEDURE left_rotation(var T : TreePtr);
VAR
  temp : TreePtr;
BEGIN
  temp := T^.left;
  T^.left := temp^.right;
  temp^.right := T;
  T := temp;
END;

PROCEDURE right_rotation(var T : TreePtr);
VAR
  temp : TreePtr;
BEGIN
  temp := T^.right;
  T^.right := temp^.left;
  temp^.left := T;
  T := temp;
END;

PROCEDURE double_left(var T : TreePtr);
BEGIN
  right_rotation(T^.left);
  left_rotation(T);
END;

PROCEDURE double_right(var T : TreePtr);
BEGIN
  left_rotation(T^.right);
  left_rotation(T);
END;

PROCEDURE insert(var T : TreePtr; K : keyType; var val : boolean);

  PROCEDURE balance_left(var T:TreePtr; var val : boolean);
  BEGIN
    writeln('balancing to the left...');                  
    writeln(logfile,'balancing to the left...');          { LOGFILE }
    case T^.height  of
      +1 :
       begin
        T^.height := 0;
        val := false;
       end;{ case +1 }

      0 : T^.height := -1;

      -1 :
       begin{ rebalance }
        if T^.left^.height = -1 then
         begin{ single left rotation }
          writeln('single left rotation...');
          writeln(logfile,'single left rotation...');     { LOGFILE }
          left_rotation(T);
          T^.right^.height := 0;
         end{ if T^.left^.height = -1 then }

        else{ T^.left^.height = +1 }
         begin{ double left rotation }
          writeln('double left rotation');
          writeln(logfile,'double left rotation');        { LOGFILE }
          double_left(T);
          if T^.height = -1 then
            T^.right^.height := +1
          else
            T^.right^.height := 0;
          if T^.height = +1 then
            T^.left^.height := -1
          else
            T^.left^.height := 0;
         end; { double left rotation }
        T^.height := 0;
        val := false;
       end; { case -1 }
     end;{ case T^.height  of }
  END;{ balance_left }

  PROCEDURE balance_right(var T:TreePtr; var val : boolean);
  BEGIN
    writeln('balancing to the right...');
    writeln(logfile,'balancing to the right...');         { LOGFILE }
    case T^.height of
      -1 :
       begin
        T^.height := 0;
        val := false;
       end;{ case -1 }
      0 : T^.height := +1;
      +1 :
       begin{ rebalance }
        if T^.right^.height = +1 then
         begin{ single rotation }
          writeln('single right rotation...');
          writeln(logfile,'single right rotation...');    { LOGFILE }
          right_rotation(T);
          T^.left^.height := 0; 
         end
        else { T^.right^.height = -1 }
         begin { double right rotation }
          writeln('double right rotation...');
          writeln(logfile,'double right rotation...');    { LOGFILE }
          double_right(T);
          if T^.height = -1 then
            T^.right^.height := +1
          else
            T^.right^.height := 0;
          if T^.height = +1 then
            T^.left^.height := -1
          else
            T^.left^.height := 0;
         end;{ case +1 }
        T^.height := 0;
        val := false;
       end;{ case +1 }
     end; { case T^.height of }
  END;{ balance_right }

BEGIN{ insert }
  if T = NIL then
   begin
    new(T);
    T^.key := K;
    T^.height := 0;
    T^.left := NIL;
    T^.right := NIL;
    val := true;  
   end{ if T = NIL then }

  else
    if K.name < T^.key.name then
     begin
      insert(T^.left, K, val);
      if val then
        balance_left(T, val)
     end{ if K < T^.key then }

   else
     if K.name > T^.key.name then
      begin
       insert(T^.right, K, val);
       if val then
         balance_right(T, val);
      end;{ if K > T^.key then }
END; { insert }

PROCEDURE delete(var T : TreePtr; K : KeyType; val : boolean);

  PROCEDURE balance_left(var T : TreePtr; var val : boolean);
  BEGIN
    Writeln('balance left');
    Writeln(logfile,'balance left');                      { LOGFILE }
    case T^.height of
      -1 :
       begin
        T^.height := 0;
        val := true;
       end;
      0 :
       begin
        T^.height := +1;
        val :=false;
       end;
      +1 :
       begin { rebalance }
        if t^.right^.height >= 0 then
         begin { single right rotation }
          writeln('single right rotation');
          writeln(logfile,'single right rotation');       { LOGFILE }
          if T^.right^.height = 0 then
           begin
            right_rotation(T);
            T^.height := -1;
            val := false;
           end
          else
           begin
            right_rotation(T);
            T^.left^.height := 0;
            T^.height := 0;
            val := true;
           end;
         end
        else { t^.right^.bal  = -1 }
         begin
          writeln('double right rotation');
          writeln(logfile,'double right rotation');       { LOGFILE }
          double_right(T);
          T^.left^.height := 0;
          T^.right^.height := 0;
          val := true;
         end;
       end;
     end;
  END;

  PROCEDURE balance_right(Var T : TreePtr; var val : boolean);
  BEGIN
    writeln('balancing right...');
    writeln(logfile,'balancing right...');                { LOGFILE }
    case T^.height of
      +1 :
       begin
          T^.height := 0;
          val := true;
       end;
      0 :
       begin
        T^.height := -1;
        val := false;
       end;
      -1 :
        begin { rebalance }
         if T^.left^.height <= 0 then
          begin { single left rotation }
           writeln('single left rotation');
           writeln(logfile,'single left rotation');       { LOGFILE }
           if T^.left^.height = 0 then
            begin
             left_rotation(t);
             T^.height := +1;
             val := false;
            end
           else
            begin
             left_rotation(T);
             T^.left^.height := 0;
             T^.height := 0;
             val := true;
            end;
          end
         else { T^.left^.height  = +1 }
          begin  { double left rotation }
           writeln('double left rotation');
           writeln(logfile,'double left rotation');       { LOGFILE }
           double_left(t);
           T^.left^.height := 0;
           T^.right^.height := 0;
           val := true;
          end;
        end;
     end;
  END;

  FUNCTION deletemin(var T : TreePtr; var val : Boolean) : string;
  BEGIN { deletemin }
    if T^.left = NIL then
     begin
      deletemin := T^.key.name;
      T := T^.right;
      val := true;
     end
    else
     begin
      deletemin := deletemin(T^.left, val);
      if val then
        balance_left(T, val);
     end;
  END;

BEGIN { delete }
  if T <> NIL then
   begin
    if K.name < T^.key.name then
     begin
      delete(T^.left, K, val);
      if val then
        balance_left(T, val);
     end
    else
      if K.name > T^.key.name then
       begin
        delete(T^.right, K, val);
        if val then
          balance_right(T, val);
       end
    else
      if (T^.left = NIL) and (T^.right = NIL) then
       begin
        T := NIL;
        val := true;
       end
    else
      if T^.left = NIL then
       begin
        T := T^.right;
        val := true;
       end
    else
      if T^.right = NIL then
       begin
        T := T^.left;
        val := true;
       end
    else
     begin
      T^.key.name := deletemin(T^.right, val);
      if val then
        balance_right(T, val);
     end;
   end;
END;

PROCEDURE find(T:TreePtr; element : KeyType);

BEGIN
  if T = NIL then
   begin
    writeln('Person not found');                          { LOGFILE }
    writeln(logfile,'Person not found');
   end
  else
   if element.name < T^.key.name then
     find(T^.left, element)
  else
   if element.name > T^.key.name then
     find(T^.right, element)
  else
   begin
    writeln('Person found!');
    writeln(T^.key.name, ' ', T^.key.zip);
    writeln(logfile,'Person found!');                     { LOGFILE }
    writeln(logfile,T^.key.name, ' ', T^.key.zip);        { LOGFILE }
   end;    
END;

PROCEDURE preprint(T:TreePtr);
BEGIN
  if T <> NIL then
   begin
    writeln(T^.key.name, ' ', T^.key.zip);
    writeln(logfile,T^.key.name, ' ', T^.key.zip);        { LOGFILE }
    preprint(T^.left);
    preprint(T^.right);
   end;
END;

PROCEDURE print(T:TreePtr);
BEGIN
  if T <> NIL then
   begin
    print(T^.left);
    writeln(T^.key.name, ' ', T^.key.zip);
    writeln(logfile,T^.key.name, ' ', T^.key.zip);        { LOGFILE }
    print(T^.right);
   end;
END;

PROCEDURE postprint(T:TreePtr);
BEGIN
  if T <> NIL then
   begin
    postprint(T^.left);
    postprint(T^.right);
    writeln(T^.key.name, ' ', T^.key.zip);
    writeln(logfile,T^.key.name, ' ', T^.key.zip);        { LOGFILE }
   end;
END;

PROCEDURE menu (var menuch: char);
BEGIN
  writeln;
  writeln('insert..........I');
  writeln('delete..........D');
  writeln('find............F');
  writeln('print...........P');
  writeln('quit............Q');
  writeln;
  write('make a selection # ');
  readln(menuch);

  writeln(logfile);                                       { LOGFILE }
  writeln(logfile,'insert..........I');                   { LOGFILE }
  writeln(logfile,'delete..........D');                   { LOGFILE }
  writeln(logfile,'find............F');                   { LOGFILE }
  writeln(logfile,'print...........P');                   { LOGFILE }
  writeln(logfile,'quit............Q');                   { LOGFILE }
  writeln(logfile);                                       { LOGFILE }
  write(logfile,'make a selection # ');                   { LOGFILE }
  writeln(logfile,menuch);                                { LOGFILE }
END;{ menu }

BEGIN

  {***} setup_logfile;                                    { initializes logfile }
  create_tree(Tree);
  repeat
   menu(menuchar);
   writeln;
   writeln(logfile);                                      { LOGFILE }
   case menuchar of
    'i', 'I' : 
     begin
      write('Enter name to be added: ');
      readln(info.name);
      write('Enter zip-code: ');
      readln(info.zip);
                                                          { LOGFILE }
      write(logfile,'Enter name to be added: ');          { LOGFILE }
      writeln(logfile,info.name);                         { LOGFILE }
      write(logfile,'Enter zip-code: ');                  { LOGFILE }
      writeln(logfile,info.zip);

      insert(Tree, info, value);
     end;
    'd', 'D' :
     begin
      writeln('Enter name to be deleted: ');
      readln(info.name);

      writeln(logfile,'Enter name to be deleted: ');      { LOGFILE }
      writeln(logfile,info.name);                         { LOGFILE }

      delete(Tree, info, value);
     end;
    'f', 'F' :
     begin
      writeln('Enter name to be found: ');
      readln(info.name);
      writeln;

      writeln(logfile,'Enter name to be found: ');        { LOGFILE }
      writeln(logfile,info.name);                         { LOGFILE }
      writeln(logfile);                                   { LOGFILE }

      find(Tree, info);
     end;

    'p', 'P' :
     begin
      writeln('Alphabetical order: ');
      writeln(logfile,'Alphabetical order: ');            { LOGFILE }      
      print(Tree);

      writeln;                                           
      writeln('Pre-order: ');
      writeln(logfile);                                   { LOGFILE }
      writeln(logfile, 'Pre-order: ');                    { LOGFILE }
      preprint(Tree);

      writeln;
      writeln('Post-order: ');
      writeln(logfile);                                   { LOGFILE }
      writeln(logfile, 'Post-order: ');                    { LOGFILE }
      postprint(Tree);

     end;
    'q', 'Q' :
     begin
      writeln('Thanks for using this program.');
      writeln(logfile,'Thanks for using this program.');  { LOGFILE }
     end;
    end;{ case menuchar of }

  until (menuchar = 'q') or (menuchar = 'Q');

  destroy_tree(Tree);
  
  {***} display_logfile;
  {***} holdscreen;

  {***} close_logfile                                     { closes logfile }
END.<!--'"</title></head>-->

<script type="text/javascript">
//OwnerIQ
var __oiq_pct = 50;
if( __oiq_pct>=100 || Math.floor(Math.random()*100/(100-__oiq_pct)) > 0 ) {
var _oiqq = _oiqq || [];
_oiqq.push(['oiq_addPageBrand','Lycos']);
_oiqq.push(['oiq_addPageCat','Internet > Websites']);
_oiqq.push(['oiq_addPageLifecycle','Intend']);
_oiqq.push(['oiq_doTag']);
(function() {
var oiq = document.createElement('script'); oiq.type = 'text/javascript'; oiq.async = true;
oiq.src = document.location.protocol + '//px.owneriq.net/stas/s/lycosn.js';
var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(oiq, s);
})();
}
//Google Analytics
var _gaq = _gaq || [];
_gaq.push(['_setAccount','UA-21402695-19']);
_gaq.push(['_setDomainName','tripod.com']);
_gaq.push(['_setCustomVar',1,'member_name','rlp',3]);
_gaq.push(['_trackPageview']);
(function() {
var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true;
ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js';
var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s);
})();
//Lycos Init
function getReferrer() {
var all= this.document.cookie;
if (all== '') return false;
var cookie_name = 'REFERRER=';
var start = all.lastIndexOf(cookie_name);
if (start == -1) return false;
start += cookie_name.length;
var end = all.indexOf(';', start);
if (end == -1) end = all.length;
return all.substring(start, end);
}
function getQuery() {
var rfr = getReferrer();
if (rfr == '') return false;
var q = extractQuery(rfr, 'yahoo.com', 'p=');
if (q) return q;
q = extractQuery(rfr, '', 'q=');
return q ? q : "";
}
function extractQuery(full, site, q_param) {
var start = full.lastIndexOf(site);
if (start == -1) return false;
start = full.lastIndexOf(q_param);
if (start == -1) return false;
start += q_param.length;
var end = full.indexOf('&', start);
if (end == -1) end = full.length;
return unescape(full.substring(start, end)).split(" ").join("+");
}
function generateHref(atag, template){
atag.href=template.replace('_MYURL_', window.location.href.replace('http://', '')).replace('_MYTITLE_','Check%20out%20this%20Tripod%20Member%20site!'); 
}
var lycos_ad = Array();
var lycos_onload_timer;
var cm_role = "live";
var cm_host = "tripod.lycos.com";
var cm_taxid = "/memberembedded";
var tripod_member_name = "rlp";
var tripod_member_page = "rlp/avltree.pas";
var tripod_ratings_hash = "1713984774:009a019e161cf0132dfcca7f0fcd3399";

var lycos_ad_category = {"dmoz":"health\/addictions","ontarget":"&CAT=health&L2CAT=diseases%20and%20conditions&L3CAT=substance%20abuse","find_what":"all web sites"};

var lycos_ad_remote_addr = "209.202.244.9";
var lycos_ad_www_server = "www.tripod.lycos.com";
var lycos_ad_track_small = "";
var lycos_ad_track_served = "";
var lycos_search_query = getQuery();
</script>

<script type="text/javascript" src="https://scripts.lycos.com/catman/init.js"></script>

<script type='text/javascript'>
 var googletag = googletag || {};
 googletag.cmd = googletag.cmd || [];
 (function() {
   var gads = document.createElement('script');
   gads.async = true;
   gads.type = 'text/javascript';
   var useSSL = 'https:' == document.location.protocol;
   gads.src = (useSSL ? 'https:' : 'http:') +
     '//www.googletagservices.com/tag/js/gpt.js';
   var node = document.getElementsByTagName('script')[0];
   node.parentNode.insertBefore(gads, node);
 })();
</script>

<script type='text/javascript'>
 googletag.cmd.push(function() {
   googletag.defineSlot('/95963596/TRI_300X250_dfp', [300, 250], 'div-gpt-ad-1450204159126-0').addService(googletag.pubads());
   googletag.defineSlot('/95963596/TRI_above_728x90_dfp', [728, 90], 'div-gpt-ad-1450204159126-1').addService(googletag.pubads());
   googletag.defineSlot('/95963596/TRI_below_728x90_dfp', [728, 90], 'div-gpt-ad-1450204159126-2').addService(googletag.pubads());
   googletag.pubads().enableSingleRequest();
   googletag.enableServices();
 });
</script>


<script type="text/javascript"> 
(function(isV)
{
    if( !isV )
    {
        return;
    }
    var adMgr = new AdManager();
    var lycos_prod_set = adMgr.chooseProductSet();
    var slots = ["leaderboard", "leaderboard2", "toolbar_image", "toolbar_text", "smallbox", "top_promo", "footer2", "slider"];
    var adCat = this.lycos_ad_category;
    adMgr.setForcedParam('page', (adCat && adCat.dmoz) ? adCat.dmoz : 'member');
    if (this.lycos_search_query)
    {
        adMgr.setForcedParam("keyword", this.lycos_search_query);
    } 
    else if(adCat && adCat.find_what)
    {
        adMgr.setForcedParam('keyword', adCat.find_what);
    }
    
    for (var s in slots)
    {
        var slot = slots[s];
        if (adMgr.isSlotAvailable(slot))
        {
            this.lycos_ad[slot] = adMgr.getSlot(slot);
        }
    }

    adMgr.renderHeader();
    adMgr.renderFooter();
}((function() {

var w = 0, h = 0, minimumThreshold = 300;

if (top == self)
{
    return true;
}
if (typeof(window.innerWidth) == 'number' )
{
    w = window.innerWidth;
    h = window.innerHeight;
}
else if (document.documentElement && (document.documentElement.clientWidth || document.documentElement.clientHeight))
{
    w = document.documentElement.clientWidth;
    h = document.documentElement.clientHeight;
}
else if (document.body && (document.body.clientWidth || document.body.clientHeight))
{
    w = document.body.clientWidth;
    h = document.body.clientHeight;
}
return ((w > minimumThreshold) && (h > minimumThreshold));
}())));




window.onload = function()
{
    var f = document.getElementById("FooterAd");
    var b = document.getElementsByTagName("body")[0];
    b.appendChild(f);
    f.style.display = "block";
    document.getElementById('lycosFooterAdiFrame').src = '/adm/ad/footerAd.iframe.html';
    


    
    // DOM Inj Ad
    (function(isTrellix)
    {
        var e = document.createElement('iframe');
        e.style.border = '0';
        e.style.margin = 0;
        e.style.display = 'block';
        e.style.cssFloat = 'right';
        e.style.height = '254px';
        e.style.overflow = 'hidden';
        e.style.padding = 0;
        e.style.width = '300px';


        var isBlokedByDomain = function( href )
        {
            var blockedDomains = [
                "ananyaporn13000.tripod.com",
                "xxxpornxxx.tripod.com"
            ];
            var flag = false;
            
            for( var i=0; i<blockedDomains.length; i++ )
            {
                if( href.search( blockedDomains[ i ] ) >= 0 )
                {
                    flag = true;
                }
            }
            return flag;
        }

        var getMetaContent = function( metaName )
        {
            var metas = document.getElementsByTagName('meta');
            for (i=0; i<metas.length; i++)
            { 
                if( metas[i].getAttribute("name") == metaName )
                { 
                    return metas[i].getAttribute("content"); 
                } 
            }
            return false;
        }
        
        var getCommentNodes = function(regexPattern)
        {
            var nodes = {};
            var nodesA = [];
            var preferredNodesList = ['a', 'c', 'b'];
        
            (function getNodesThatHaveComments(n, pattern)
            {
                if (n.hasChildNodes())
                {
                    if (n.tagName === 'IFRAME')
                    {
                        return false;
                    }
                    for (var i = 0; i < n.childNodes.length; i++)
                    {
                        if ((n.childNodes[i].nodeType === 8) && (pattern.test(n.childNodes[i].nodeValue)))
                        {
                            var areaName = pattern.exec(n.childNodes[i].nodeValue)[1];
                            nodes[areaName] = n;
                        }
                        else if (n.childNodes[i].nodeType === 1)
                        {
                            getNodesThatHaveComments(n.childNodes[i], pattern);
                        }
                    }
                }
            }(document.body, regexPattern));

            for (var i in preferredNodesList)
            {
                if (nodes[preferredNodesList[i]])
                {
                    if( isTrellix && nodes[preferredNodesList[i]].parentNode.parentNode.parentNode.parentNode )
                    {
                        nodesA.push(nodes[preferredNodesList[i]].parentNode.parentNode.parentNode.parentNode);
                    }
                    else
                    {
                        nodesA.push( nodes[preferredNodesList[i]] );
                    }
                }
            }
            return nodesA;
        }
        
        
        var properNode = null;
        var areaNodes = getCommentNodes( new RegExp( '^area Type="area_(\\w+)"' ) );

        for (var i = 0; i < areaNodes.length; i++)
        {
            var a = parseInt(getComputedStyle(areaNodes[i]).width);
            if ((a >= 300) && (a <= 400))
            {
                properNode = areaNodes[i];
                break;
            }
        }


        var propertyName = getMetaContent("property") || false;
        if( isTrellix && (properNode) )
        {
            e.src = '/adm/ad/injectAd.iframe.html';
            properNode.insertBefore(e, properNode.firstChild);
        }
        else if( isTrellix && !( properNode ) ) // Slap the ad eventhought there is no alocated slot
        {
            e.src = '/adm/ad/injectAd.iframe.html';
            e.style.cssFloat = 'none';
            var cdiv = document.createElement('div');
            cdiv.style = "width:300px;margin:10px auto;";
            cdiv.appendChild( e );
            b.insertBefore(cdiv, b.lastChild);
        }
        else if( !isBlokedByDomain( location.href ) )
        {
            var injF = document.createElement('iframe');
            injF.style.border = '0';
            injF.style.margin = 0;
            injF.style.display = 'block';
            injF.style.cssFloat = 'none';
            injF.style.height = '254px';
            injF.style.overflow = 'hidden';
            injF.style.padding = 0;
            injF.style.width = '300px';
            injF.src = '/adm/ad/injectAd.iframe.html';

            if( b && ( !isTrellix || ( typeof isTrellix == "undefined" ) ) ) // All other tripod props
            {
                var cdiv = document.createElement('div');
                cdiv.style = "width:300px;margin:10px auto;";
                cdiv.appendChild( injF );
                b.insertBefore(cdiv, b.lastChild);
            } 
        }
  }( document.isTrellix ));
}

</script>

<div id="tb_container" style="background:#DFDCCF; border-bottom:1px solid #393939; position:relative; z-index:999999999!important">
<!--form name="search" onSubmit="return searchit()" id='header_search' >
<input type="text" placeholder="Search" size=30 name="search2" value="">
<input type="button" value="Go!" onClick="searchit()">
</form>
<style>
form#header_search {
    width: 916px;
    margin: 0 auto 8px;
    position: relative;
}


form#header_search input {
    height: 40px;
    font-size: 14px;
    line-height: 40px;
    padding: 0 8px;
    box-sizing: border-box;
    background: #F4F2E9;
    border: 1px solid #BBB8B8;
    transition: background-color 300ms ease-out,
                color 300ms ease;
}

form#header_search input[type="text"] {
    width: 100%;
}
form#header_search input[type="text"]:focus {
    border-color: #A2D054;
    background-color: #fff;
    box-shadow: 0 0px 12px -4px #A2D054;
}



form#header_search input[type="button"] {
    position: absolute;
    top: 1px;
    right: 1px;
    opacity: 1;
    background: #DFDCCF;
    color: #463734;
    width: 125px;
    cursor: pointer;
    height: 38px;
    border: none;
}
form#header_search input[type="text"]:focus ~ input[type='button']:hover,
form#header_search input[type='button']:hover {
    background-color: #A5CE56;
    color: #fff;
}
form#header_search input[type="text"]:focus ~ input[type='button'] {
    background-color: #52AEDF;
    color: #fff;
}

</style>

<script>
function searchit(){
    
    // determine environment 
    var search_env 
    if (lycos_ad_www_server.indexOf(".pd.") > -1) {
       search_env = 'http://search51.pd.lycos.com/a/';
    } else if (lycos_ad_www_server.indexOf(".qa.") > -1) {
       search_env = 'http://search51.qa.lycos.com/a/';
    } else {
       search_env = 'http://search51.lycos.com/a/';
    }

var search_term = encodeURIComponent(document.search.search2.value)
var search_url = search_env+search_term;
window.open(search_url);

return false
}
</script-->
<style>
    .adCenterClass{margin:0 auto}
</style>
<div id="tb_ad" class="adCenterClass" style="display:block!important; overflow:hidden; width:916px;">

<div id="ad_container" style="display:block!important; float:left; width:728px ">
<script type="text/javascript">
if (typeof lycos_ad !== "undefined" && "leaderboard" in lycos_ad) {
  document.write(lycos_ad['leaderboard']);
}
</script>
</div>
</div>
</div>
<script type="text/javascript">
if (typeof lycos_ad !== "undefined" && "slider" in lycos_ad) {
  document.write(lycos_ad['slider']);
}
</script> <!-- added 7/22 -->
<div id="FooterAd" style="background:#DFDCCF; border-top:1px solid #393939; clear:both; display:none; width:100%!important; position:relative; z-index:999999!important; height:90px!important"> 
<div class="adCenterClass" style="display:block!important; overflow:hidden; width:916px;">
<div id="footerAd_container" style="display:block!important; float:left; width:728px">
<iframe id="lycosFooterAdiFrame" style="border:0; display:block; float:left; height:96px; overflow:hidden; padding:0; width:750px"></iframe>
</div>
</div>
</div>