思路:先序遍历,将节点存到数组,然后依次进行连接和赋值
var flatten = function(root) {
const res = [];
const helper = function(root){
if(!root) return;
res.push(root);
helper(root.left);
helper(root.right);
}
helper(root);
const head = res[0];
for(let i = 0; i < res.length - 1; i++){
res[i].left = null;
res[i].right = res[i+1];
}
return head;
}
二叉树转化为链表
最新推荐文章于 2024-10-02 00:07:14 发布