[자바,java] TreeSet 이론 및 실습

TreeSet : 중복허용하지않음. 입력순서 유지하지 않음, 크기순서대로 정렬됨

import java.util.Iterator;
import java.util.TreeSet;

public class TreeSetTest {
	public TreeSetTest() {
		int numData[] = {10,20,30,40,50,60,70,80,90,10,20,20,20,20};
		String strData[]= {"홍길동","세종대왕","홍길동","홍길동","이순신","이순신","김정희"};
		
		TreeSet<Integer> ts = new TreeSet<Integer>();
		for(int n: numData) {
			ts.add(n);
		}
		TreeSet<String> ts2 = new TreeSet<String>();
		for(String a: strData) {
			ts2.add(a);
		}
		
		Iterator<Integer> ii =ts.iterator();
		while(ii.hasNext()) {
			System.out.println("ts -> "+ ii.next());
		}
	}
	public static void main(String[] args) {
		new TreeSetTest();
	}
}

ts -> 10
ts -> 20
ts -> 30
ts -> 40
ts -> 50
ts -> 60
ts -> 70
ts -> 80
ts -> 90