title: Implementing a node class for a binary tree
body: <p>I've got to implement a form of <code>binary tree</code> where it shows a hierarchy of employment where a boss is the trees root and a lesser employee is the left node and the right node is an employee of the same level. Employees on the same level are placed in accordance to their employee number.</p>
  
  <pre><code>public class Node {
  private Person data;
  private Node seniorEmployee;
  private Node nextEmployee;
  private Node lesserEmployee;
  
  public Node(Member data, Node seniorEmployee) {
      this.data = data;
      this.seniorEmployee = seniorEmployee;
      this.nextEmployee = null;
      this.lesserColleague = null;
  }
  
  public Member getPerson() {
      return this.data;
  }
  
  public Node getSeniorEmployee() {
      return this.seniorEmployee;
  }
  
  public Node getNextEmployee() {
      return this.nextEmployee;
  }
  
  public Node getLesserEmployee() {
      return this.lesserEmployee;
  }
  
  public void setEmployee(Person e1) {
      if (nextEmployee == null) {
          nextEmployee = new Node(e1, this.seniorEmployee);
      } else {
          if (e1.compareTo(nextEmployee.getPerson()) &gt; 0) {
  
      } else {
  
      }
  }
  
  public void setLesserEmployee(Member p1) {
      if (lesserEmployee == null) {
          lesserEmployee = new Node(e1, this.seniorEmployee);
      } else {
          if (e1.compareTo(lesserEmployee.getPerson()) &gt; 0) {
  
      } else {
  
      }
  }
  </code></pre>
  
  <p>This is what I've managed to do so far, but I do not know how to implement the set methods.</p>