请使用以下代码尝试一次：

const arr1 = [
  { id: 1, refId: null, name: "jhon" },
  { id: 2, refId: null, name: "sam" },
  { id: 3, refId: 1, name: "fam" },
  { id: 4, refId: 2, name: "jam" },
  { id: 5, refId: 16, name: "ram" },
  { id: 6, refId: 15, name: "nam" },
];

console.log(
  arr1.filter((obj) => {
    return obj.refId === null || arr1.some((o) => o.id === obj.refId);
  })
);

这里有一个树结构，如果树很小，使用过滤器或一些是好的，但如果树很大，你应该尝试用Map（字典）。

let nodes = [
  {id: 1 , refId:null, name:'jhon'},
  {id: 2 , refId:null, name:'sam'}, 
  {id: 3 , refId:1, name:'fam'},
  {id: 4 , refId:2, name:'jam'}, 
  {id: 5 , refId:16, name:'ram'}, 
  {id: 6 , refId:15, name:'nam'}
]

let dictionary = nodes.reduce((dic, node) => { dic[node.id] = true; return  dic; }, { [null]: true });
let result = nodes.filter((node) => dictionary[node.refId]);

console.log(result);