MS-SQL은 connect by 쿼리가 없어서
아래와 같이 약간 복잡하게 
Sort 시킬 컬럼을 만들어 줘야 합니다.

with tree_table AS (
    select 1 ID, null PARENT, 1 second
    union all 
    select 2, 1, 2
    union all 
    select 3, 1, 1
    union all 
    select 4, null, 2
    union all 
    select 5, null, 3
    union all 
    select 6, 5, 1
    union all 
    select 7, 5, 3
    union all 
    select 8, 5, 2
    union all 
    select 9, null, 4
    union all 
    select 10, 9, 1
) 
select id, parent, second, sort
from (
	SELECT id, parent, second
		   , convert(varchar(255), second) sort 
	FROM tree_table
	WHERE parent is NULL
	UNION ALL
	SELECT B.id, B.parent, B.second
		   ,convert(varchar(255), convert(nvarchar,C.second) + ' > ' + convert(varchar(255), B.second)) sort
	FROM tree_table B, tree_table C
	WHERE B.parent = C.id
) t
order by sort

오라클이면 아래 같은 쿼리로 쉽게 처리가 가능합니다.
select *
from (
    select 1 ID, null PARENT, 1 second from dual
    union all 
    select 2, 1, 2 from dual
    union all 
    select 3, 1, 1 from dual
    union all 
    select 4, null, 2 from dual
    union all 
    select 5, null, 3 from dual
    union all 
    select 6, 5, 1 from dual
    union all 
    select 7, 5, 3 from dual
    union all 
    select 8, 5, 2 from dual
    union all 
    select 9, null, 4 from dual
    union all 
    select 10, 9, 1 from dual
) t
start with parent is null
connect by prior id=parent
order siblings by second    

감사합니다~!

MSSQL로 구현한 코드는 CTE재귀처리인거죠??