前端深拷贝 树结构的生成-高级JS

最近看了两个面试题，之前有写过，再写一遍
深拷贝

 		let obj = {
            x: 0,
            y: [1, 2, 3],
            z: {
                a: 0,
                b: 1
            }
        }

        function fn(obj) {
            if (!obj) return {}
            let val = Array.isArray(obj) ? [] : {}
            if (obj && typeof obj === "object") {
                for (let k in obj) {
                    if (obj[k] && typeof obj[k] === "object") {
                        val[k] = fn(obj[k])
                    } else {
                        val[k] = obj[k]
                    }
                }

            } 
            return val
        }
        console.log(111, fn(obj));

一维数组转成树结构
下面代码修改一个地方可以更加看的懂

	if (v.pid === i) {
	     v.children = fn(result, v.id)
	     arr.push(v)
	 }

		let target = [
            {
                id: 1,
                name: "部门1",
                pid: 0,
                children: [
                    {
                        id: 2,
                        name: "部门2",
                        pid: 1,
                        children: []
                    }, {
                        id: 3,
                        name: "部门3",
                        pid: 1,
                        children: [
                            {
                                id: 4,
                                name: "部门4",
                                pid: 3,
                                children: [
                                    {
                                        id: 5,
                                        name: "部门5",
                                        pid: 4
                                    }
                                ]

                            }
                        ]
                    },
                ]
            }
        ]

        let result = [
            { id: 1, name: "部门1", pid: 0 },
            { id: 2, name: "部门2", pid: 1 },
            { id: 3, name: "部门3", pid: 1 },
            { id: 4, name: "部门4", pid: 3 },
            { id: 5, name: "部门5", pid: 4 }
        ]

        function fn(result, i) {
            let arr = []
            result.forEach((v => {
                if (v.pid === i) {
                    arr.push(v)
                    v.children = fn(result, v.id)
                }
                if(v.children?.length === 0) {
                    delete v.children
                }
            }))
            return arr
        }

        console.log(fn(result, 0));