TreeDataSort

TreeDataSort

package brokendish;

import java.util.ArrayList;
import java.util.Comparator;

public class TreeDataSort implements Comparator<NodeDataStruct>{

	public TreeDataSort(){
		super();
	}
	
	public int compare(NodeDataStruct t1, NodeDataStruct t2) {
		//複数SORTキーを設定「第１キー：getLevel」「第２キーgetNode」
        String t1str = t1.getLevel()+t1.getNode();
        String t2str = t2.getLevel()+t2.getNode();
        
        System.out.println("--@@---"+ t1str + "--@@--" + t2str);
        return t1str.compareTo(t2str);
      }


}