How to find the intersection and mark two multi-dimensional arrays

two deep arrays An and B with different levels of depth have the same ID. If they exist, mark them under the corresponding object in array A

. 
var A= [{
        id: 1
    }, {
        id: 2,
        children: [{
            id: 3
        }, {
            id: 4
        }, {
            id: 5,
            children: [{
                id: 6
            }]
        }]
    }];
    var B= [{
        id: 1
    }, {
        id: 2,
        children: [{
            id: 5,
            children: [{
                id: 6
            }]
        }]
    }];
    let c = method(A,B)
    //
    c = [{
        id: 1,
        disabled:true
    }, {
        id: 2,
        disabled:true,
        children: [{
            id: 3
        }, {
            id: 4
        }, {
            id: 5,
            disabled:true,
            children: [{
                id: 6,
                disabled:true
            }]
        }]
    }];
Javascript
Apr.08,2022 
function method(A, B) {
  var ret = []
  A.forEach(itemA => {
    var r = B.find(itemB => itemB.id === itemA.id)
    var obj = Object.assign({}, itemA)
    ret.push(obj)
    if (r) {
      obj.disabled = true
      if (itemA.children && r.children) {
        obj.children = method(itemA.children, r.children)
      }
    }
  })
  return ret
}

if the quantity is small, it is acceptable to cross and traverse the tree constantly, and if you save the point of B, it can be accelerated for follow-up. The idea is for reference 

function method (treeA, treeB) {
  return dfs(treeA, new Set(flat(treeB)))
}

function dfs (root, dict) {
  for (node of root) {
    if (dict.has(node.id)) {
      node.disabled = true
    }
    if (node.children) {
      dfs(node.children, dict)
    }
  }
  return root
}

function flat (root, path = []) {
  for (node of root) {
    path.push(node.id)
    if (node.children) {
      flat(node.children, path)
    }
  }
  return path
}

Previous: In a production environment, it is better to have a more powerful server or multiple servers with relatively low performance.

Next: Should the background management system be made into a mobile terminal?

css mysql arrays josn react html typescript webpack npm sass R objective-c .net sql-server jquery python-3.x angularjs django angular excel regex iphone ajax linux xml pandas vba spring database wordpress string wpf xcode windows bash postgresql oracle multithreading eclipse list firebase algorithm macos forms image scala visual-studio azure bootstrap spring-boot react-native python-2.7 docker performance function winforms matlab powershell apache dataframe api sqlite numpy rest shell selenium flutter dart maven loops qt swing android-studio csv express file class tensorflow sorting codeigniter perl
MySQL Query : SELECT * FROM `codeshelper`.`v9_news` WHERE status=99 AND catid='6' ORDER BY rand() LIMIT 5
MySQL Error : Disk full (/tmp/#sql-temptable-64f5-436de8c-4edd.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
MySQL Errno : 1021
Message : Disk full (/tmp/#sql-temptable-64f5-436de8c-4edd.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
Need Help?