Adding to a Linked Complete Binary Tree

Question

Hi all,
I am having major trouble trying to grasp the concept behind adding to a Complete Binary Tree (linked structure). It is part of a much larger assignment that uses a Heap Priority Queue and I am genuinely stuck. I have noticed that there seems to be some sort of strike going on so I wont expect a reply to this.
I understand that Binary Tree's are useful because of their recursive nature, does the process of adding use recursion also. My mind is a mess at the moment so forgive the rambling. My problem exists when I go to add after a right child on a lower level(anything below level 3). I have come to the conclusion that I it is impossible to continue with my adding method and that I should scrap it. Can anyone point anything relevant out to me? I'd appreciate it, thank you.
public class LinkedBT implements CompleteBT
     private BTNode root;          //a reference to the root node
     private BTNode current;          //a reference to the last inserted node
     private BTNode firstNodeInLevel; //a reference to the first node in the level
     private int size;               //keeps track of the size of the BT
     private int currentLevel;
     private int leafCount;
     public LinkedBT()
          root = null;     //instantiate instance variables
          current = null;
          size = 0;
          currentLevel = 0;     //indicates that there are no nodes
          leafCount = 0;
          firstNodeInLevel = null;
     public boolean isEmpty()     
          return (root==null);
     public int size()
          return size;
     public void add(Object obj, int priority)
          BTNode tempNode = new BTNode(obj, priority);
          tempNode.parent = current;                                   //set the parent of the node to current
          if(isEmpty())                                             //if the tree is empty then make a new BTNode and give it the root reference
               root = tempNode;     
               current = root;                                        //make current reference to the root node
               size++;
               currentLevel++;                //increments currentLevel
               return;                          //return control to calling method
          if(current.childrenFull!=true)          //if the current node has available children positions then check left and right and add BTNode appropriately
               if(current.leftChild==null)
                    if(leafCount==0)     //if this is the first node to be added on any given level then.....
                         firstNodeInLevel = tempNode;     //.....store a reference to it for future adding purposes
                    current.leftChild = tempNode;     //adds BTNode to left child
                    leafCount++;
               else
                    current.rightChild = tempNode;          //add BTNode to right child
                    leafCount++;
                    current.childrenFull = true;          //after adding the right child set the childrenFull property true NECESSARY?????
                    if(Math.pow(2, currentLevel)==leafCount)     //IF THIS EVALS TO TRUE THEN THE MAX NUMBER OF LEAVES FOR THAT LEVEL IS REACHED
                         currentLevel++;     //increment the level
                         leafCount = 0;     //reset the leaf count
                         current = firstNodeInLevel;          //change current to the furthest leaf on the left
                    else     //ELSE NEED TO GO BACK UP AND FIND NEXT FEASIBLE POSITION
                         //while(current.parent.rightChild.leftChild.)----------------THIS DOESNT WORK WHEN THE TREE GETS BIGGER
                              //current = current.parent; //set current to next feasible position
          size++;
     public Object getRoot()
          return root;
     public void heapSort()
     private class BTNode
          private Object value;
          private int key;
          private BTNode parent;
          private BTNode leftChild;
          private BTNode rightChild;
          private boolean childrenFull;      //initially false, when both children are occupied then change to true
          private BTNode(Object obj, int priority)     //constructor accepts the value and the priority key
               value = obj;          
               key = priority;
               parent = null;
               leftChild = null;
               rightChild = null;
               childrenFull = false;
          public boolean hasNoChildren()
               return(leftChild==null && rightChild==null);     //returns true if the node has no children
}

Answer 1

Currently working on setting the Linked Servers Security properties. Added the SQLAgent in the" Local server login to remote server login mappings:". The SQLAgent is the only entry in the grid. The SQLAgent has the Remote User and Remote Password
of the AS400. Then below have "Not be made" for "For a login not defined in the lst above, connections will:".
So provided that the SQL Admin only gives SQL Job create, Job Alter and Alter Linked Server to user/groups that he wants to use the linked server the Admin can control access to the linked server.
Any thoughts?