二叉树转换链表

二叉树转换链表

treeRoot =

new BioTree(1,new BioTree(2,new BioTree(3),new BioTree(4)

),new BioTree(5,new BioTree(6)

)

);

function recur(node,handler) {

if (node.left) {

recur(node.left,handler);

}

handler(node);

if (node.right) {

recur(node.right,handler);

}

}
let head = null;

let pre = null;

recur(treeRoot,v => {

if (pre === null) {

pre = v;

head = v;

} else {

pre.right = v;

pre = pre.right;

}

});
console.log('=================');
let cur = head

while(cur) {

console.log(cur.data);

cur = cur.right;

}

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!