Help me with an implementation of a 2-3-4 three

Question

so here's my code first of all:
public class TwoNode extends AbstractNode{
      private TwoFive leftTree = new TwoFive();
      private String data;                     
      private TwoFive rightTree = new TwoFive();
      public TwoNode(String word) {
             data = word;
     @Override
     public void inOrder() {
     @Override
     public void insert(TwoFive T, String d) {
          AbstractNode node = search(T, d);
     @Override
     public boolean isEmpty(TwoFive tree) {
          // TODO Auto-generated method stub
          return false;
     @Override
     public AbstractNode search(TwoFive T, String n) {
          if (data.equals(n))
               return this;
          else{
             if (data.compareTo(n) < 0){
                 return leftTree.search(n);
             }else
                 return rightTree.search(n);
}and here's the TwoFive class:
public class TwoFive {
     private AbstractNode root;
     public TwoFive(){
          root = null;
     public TwoFive(String n){
        root = new TwoNode(n);
     public final boolean isEmpty() {
        return root.isEmpty(this);
     public void insert(String n) {
        root.insert(this,n);
     public AbstractNode search(TwoFive T, String n){
          return root.search(this, n);
}do you think the searching will work?
I am not really sure if I need that extra parameter TwoFive T, in the TwoFive class

Answer 1

I left my mind-reading cap at work, so how's about a little more information. Or even better, a lot more information. You would do yourself and all of us a favor by reading this before posting again in this forum: [How To Ask Questions The Smart Way|http://www.catb.org/~esr/faqs/smart-questions.html]
Note that this is not being smarmy as I re-read this site at least twice a month. If you follow it you will post questions that others will actually want to answer.