You can traverse the tree by a recursive function. You can think of the data structure as an M tree. Also I have used the closures for data ...
確定! 回上一頁