Tree data processing method and system

Abstract

The invention provides a tree data processing method and system. The method comprises the steps of obtaining a target tree structure; traversing a node array in the target tree structure, and calling each element in the array by adopting a recursive method to obtain a node type of each element; and performing visual rendering on the elements subjected to recursive calling so as to realize data processing of accurately searching the child nodes. In order to solve similar demand difficulties and realize logic component multiplexing, the invention provides an implementation mode of realizing an accurate search result without depending on other logics of nodes and reserving a tree structure hierarchy, wherein unified input is a tree structure array, nodes are provided with unique index marks and title texts; and search processing of the tree structure data is conveniently and quickly realized.

Description

technical field [0001] The invention relates to the technical field of data processing, in particular to a tree data processing method and system. Background technique [0002] With the rapid development of the Internet, data information on the web has become a huge information warehouse. The use of the web to display more information can help people find target information more quickly and accurately, speed up information acquisition, and improve work efficiency. The display scene of enterprise data is often displayed in a tree structure with organization, region, and authority levels. Under objective conditions such as massive data nodes connected to third-party platforms and complex node levels, and third-party interfaces returning fixed tree structure data formats, The demands of modern Internet enterprise applications pursuing high user experience are to provide convenient search, child node matching to accurately find target nodes, parent directory matching to retain a...

AI Technical Summary

Problems solved by technology

[0003] In web enterprise-level background applications, it is very common to display data results in a tree structure and search for results. For tree structure application scenarios, it is generally necessary to traverse the list data, and need to add a large number of tags and multiple pairs of lists Data traversal is used to record node relationships for search matching and hierarchical restoration. This kind of implementation process is relatively complicated. The list data of different enterprise APIs often needs to be adjusted repeatedly due to different field structures, which is not conducive to the realization of component reuse and cost reduction in enterprise applications. , prone to abnormal problems

Images