Need to delete a method, Search for an element and then implement the post order

Question

Need to delete a method, Search for an element and then implement the post order traversal

   Node root;

   public void addNewNode(int key, String title, String name){
      
  
       Node leader = new Node(key, title, name);
      
  
       if(root == null){
           root = leader;
       }else{
  
           Node currentNode = root;
          
           Node parent;
          
           while(true){
               parent = currentNode;
              
               if(key < currentNode.key){
                   currentNode = currentNode.leftChild;
                  
                   if(currentNode == null){
                       parent.leftChild = leader;
                       return;
                   }
               }
      
               else{
                   currentNode = currentNode.rightChild;
                   if (currentNode ==null){
                       parent.rightChild = leader;
                       return;
                   }
               }  
           }
       }
   }
  
   public void leaderInOrderTraverse(Node currentNode){
       if(currentNode !=null){
  
           leaderInOrderTraverse(currentNode.leftChild);
           System.out.println(currentNode);
          
  
           leaderInOrderTraverse(currentNode.rightChild);  
       }
   }
  
   public void leaderPreOrderTraverse(Node currentNode){
       if(currentNode !=null){
           System.out.println(currentNode);
          
           leaderPreOrderTraverse(currentNode.leftChild);
          
  
           leaderPreOrderTraverse(currentNode.rightChild);
           System.out.println(currentNode);
       }
   }
   public static void main(String[] args) {
       Leadership_bst lbst = new Leadership_bst();
      
       lbst.addNewNode(60, "President", "Rebecca L. Sherrick, PhD");
       lbst.addNewNode(55, "VP Student Life", "Lora de Lacey, PhD");
       lbst.addNewNode(100, "VP for Enrollment, Executive Dean of Adult and Graduate Studies", "Donna DeSpain, EdD");
       lbst.addNewNode(57, "VP for Finance", "David Eisinger, DBA, CFA");
       lbst.addNewNode(45, "Executive VP", "Andrew Manion, PhD");
       lbst.addNewNode(67, "VP for University Communications and Admin", "Steven McFarland");
       lbst.addNewNode(101, "Executive VP", "Ted Parge, CFRE");
       lbst.addNewNode(107, "Provost", "Joan Poor, PhD");
       lbst.addNewNode(59, "VP for Community Relations", "Sarah Russe");
      
       //lbst.leaderInOrderTrav
      
       lbst.leaderPreOrderTraverse(lbst.root);

   }

}
class Node{
   int key;
  
   String emp_name;
  
   String title_desc;
  
   Node leftChild;
   Node rightChild;
  
   Node(int key, String title, String name){
       this.key = key;
       this.title_desc = title;
       this.emp_name = name;
   }

Explanation / Answer

class Node{
int key;
  
String emp_name;
  
String title_desc;
  
Node leftChild;
Node rightChild;
  
Node(int key, String title, String name){
this.key = key;
this.title_desc = title;
this.emp_name = name;
}
}
class Leadership_bst {
public Node root;
public void addNewNode(int key, String title, String name){
  
  
Node leader = new Node(key, title, name);
  
  
if(root == null){
root = leader;
}else{
  
Node currentNode = root;
  
Node parent;
  
while(true){
parent = currentNode;
  
if(key < currentNode.key){
currentNode = currentNode.leftChild;
  
if(currentNode == null){
parent.leftChild = leader;
return;
}
}
  
else{
currentNode = currentNode.rightChild;
if (currentNode ==null){
parent.rightChild = leader;
return;
}
}
}
}
}
  
public void leaderInOrderTraverse(Node currentNode){
if(currentNode !=null){
  
leaderInOrderTraverse(currentNode.leftChild);
System.out.println(currentNode.key+" "+currentNode.title_desc+" "+currentNode.emp_name);
  
  
leaderInOrderTraverse(currentNode.rightChild);
}
}
  
public void leaderPreOrderTraverse(Node currentNode){
if(currentNode !=null){
System.out.println(currentNode.key+" "+currentNode.title_desc+" "+currentNode.emp_name);
  
leaderPreOrderTraverse(currentNode.leftChild);
  
  
leaderPreOrderTraverse(currentNode.rightChild);

}
}
public boolean search(int key)
{
Node currentNode = root;
if(root==null)
return false;
while(currentNode!=null)
{
if(currentNode.key==key)
return true;
else if(currentNode.key > key)
{
currentNode = currentNode.leftChild;
}
else
{
currentNode = currentNode.rightChild;
}
}
return false;
}
public void leaderPostOrderTraverse(Node currentNode){
if(currentNode !=null){
  
leaderPostOrderTraverse(currentNode.leftChild);
  
  
leaderPostOrderTraverse(currentNode.rightChild);
  
System.out.println(currentNode.key+" "+currentNode.title_desc+" "+currentNode.emp_name);

}
}
  
}
class TestClass{
public static void main(String[] args) {
Leadership_bst lbst = new Leadership_bst();
  
lbst.addNewNode(60, "President", "Rebecca L. Sherrick, PhD");
lbst.addNewNode(55, "VP Student Life", "Lora de Lacey, PhD");
lbst.addNewNode(100, "VP for Enrollment, Executive Dean of Adult and Graduate Studies", "Donna DeSpain, EdD");
lbst.addNewNode(57, "VP for Finance", "David Eisinger, DBA, CFA");
lbst.addNewNode(45, "Executive VP", "Andrew Manion, PhD");
lbst.addNewNode(67, "VP for University Communications and Admin", "Steven McFarland");
lbst.addNewNode(101, "Executive VP", "Ted Parge, CFRE");
lbst.addNewNode(107, "Provost", "Joan Poor, PhD");
lbst.addNewNode(59, "VP for Community Relations", "Sarah Russe");
  
//lbst.leaderInOrderTrav
System.out.println(" Pre Order ");
lbst.leaderPreOrderTraverse(lbst.root);
System.out.println(" In Order");
lbst.leaderInOrderTraverse(lbst.root);
if(lbst.search(55))
System.out.println("element found ");
else
System.out.println("element not found ");
  
if(lbst.search(65))
System.out.println("element found ");
else
System.out.println("element not found ");
System.out.println("Post order");
lbst.leaderPostOrderTraverse(lbst.root);
  
}
}

Output:

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.