对嵌套较深的对象进行递归迭代以找到父对象

{  id: 1,
   name: "Dog",
   parent_id: null,
   children: [
         {
             id: 2,
             name: "Food",
             parent_id: 1,
             children: []
         },
         {
             id: 3,
             name: "Water",
             parent_id: 1,
             children: [
                 {
                    id: 4,
                    name: "Bowl",
                    parent_id: 3,
                    children: []
                 },
                 {
                    id: 5,
                    name: "Oxygen",
                    parent_id: 3,
                    children: []
                 },
                 {
                    id: 6,
                    name: "Hydrogen",
                    parent_id: 3,
                    children: []
                 }
             ]
         }
   ]
}

任何子数据对象都可以有更多的子对象,如上面的数据所示。这表示一个DOM结构,用户可以从中选择要添加子项的项。

我有一个从DOM中选择的项的已知文本标题以及用户想要插入的数据。我很难找到一个递归算法,使我能够添加新的数据到树的正确水平。

下面是我思考问题并尝试对其进行伪代码的列表:

输入:

2. DOM中单击项的parentTitle

输出:

1. 确定最高使用id以知道下一个唯一id是什么
2. 检查当前数据级别是否与父级标题匹配
3. 如果匹配,则在新数据中设置id和parent\u id并推入父对象的子对象
4. 如果不匹配,则检查当前级别数据是否有子级
5. 如果当前级别有子级,则需要对每个子级重复步骤2+,直到找到匹配项为止

这是我的密码:

function askUserForNewItem(e) {
   const tree = getTree(); // returns above tree data structure
   const name = prompt( 'Enter new item’s name:' ); // user input to match and insert as new item in tree
   const clickedTitle = getClickedTitle(e); // returns string title of clicked on item from DOM - for example "Dog" or "Bowl"
   const parent = determineParent(tree, clickedTitle);
   const parent_id = parent[0].id;
   // TODO - needs to set real unique id (highest unused id)
   const newId = 101; // hard coded for now, needs to be dynamic
   // TODO - needs to insert into correct level of children array in tree
   return tree.children.push({ id: newId, name, emoji, children: [], parent_id: parent_id });
}

function determineParent(tree, clickedTitle) {

    if(tree.children.length === 0) {
        return false;
    }
    let treeLevel = tree;
    let parent = [];
    while(treeLevel.children.length !== 0) {
        parent = treeLevel.children.filter(child => child.name === clickedTitle);
        if(parent.length !== 0) {
            break;
        }
        else {
            // what to do here to make this recursive?
        }
    }

    return parent;
}

{
    id: 7,
    name: "Cat",
    parent_id: 1,
    children: []
}