请问这个函数如何改写成尾递归？

今天在写一个层级菜单选中高亮的逻辑的时候，无意看到“尾递归”这个概念。看了阮老师的 一篇文章 感觉很好理解，但是当我尝试去把我的递归逻辑进行修改时，感觉无从下手，请大佬指导一下 O.O
下面的代码在 codepen 上也放了个方便看些 求助，如何优化递归

let menuList = [ { path: '/A', selected: true }, { path: '/B', selected: false, children: [ { path: '/B/B-1', selected: false } ] }, { path: '/C', selected: false, children: [ { path: '/C/C-1', selected: false }, { path: '/C/C-2', selected: false, children: [ { path: '/C/C-2/C-2-1', selected: false } ] } ] } ]; function checkSelected(path) { menuList = recursive(menuList, path); function recursive(list, path) { return list.map(item => { if (item.children && item.children.length) { item.children = recursive(item.children, path); } return { ...item, selected: path.includes(item.path) }; }); } }