And then sort the child nodes of each node in the ascending order using IComparer interface.将树载入内存可以看做是树的存储么？能否定义结点类然后用左孩子——右兄弟的方法来做呢？