DaviHao

附上递归的算法：LinkList ReverseLinkList( pNode PreNode, pNode CurrentNode ) { if(!CurrentNode) /*如果当前节点指针为空，则返回NULL，此种情况只有在*/ return NULL; /*链表头指针为空时才可能执行到*/ if(!CurrentNode->next) /*如果下一节点指针为空，则将

function Tree(name,parent,child){ this.name = name; this.parent = parent || ''; this.children = child || []; this.addNode = function (parent){ this.children = parent; } this.addChild = function (child