这里我利用LabVIEW的Register变量和分离链地址法实现了一个类似于HashTable的员工信息存储，从而可以实现在限定范围内（5000员工）的快速搜索――复杂度为O(1)，另外在存储员工的信息中加上直接下级员工的编号，就可以实现树型人员组织结构的遍历搜索。-Here I use the LabVIEW Register variables and separate chaining address method to achieve a similar HashTable employee information storage, which can be achieved within a limited range (5,000 employees) Quick Search- complexity is O (1), another in the storage employee information to add the number of subordinates directly, you can achieve the organizational structure of the tree traversal search personnel.