글쎄, 여기에 내가 개발 한 대답이있다. 물론 더 좋은 방법이 있습니다.
function walk_tree(node, parent_stem, at_root) {
if (node == null || node == undefined || $(node) == undefined)
return ;
var i = 0 ;
var serialized_tree = '' ;
var stem = '' ;
// loop through siblings
do {
// build up the serialized statement for this node
stem = parent_stem + '[' + i + ']' ;
serialized_tree += (at_root ? '' : '&') + stem + '[id]=' + $(node).identify().gsub('page_','')
// if node has children, then recurse...
if ($(node).down('li') != undefined)
serialized_tree += walk_tree($(node).down('li'), stem, false) ;
// carry on finding siblings
node = $(node).next('li') ;
i++ ;
} while ($(node) != undefined) ;
return(serialized_tree) ;
} ;