Concept of multiple hanging nodes and Basic Nodes

Technorati label: multi-node mounting, tree class, VBA

Copyright statement: You can reprint it at will.Hyperlink formIndicate the source and author information of the following articles andThis statement

Author: Xixi

Source: http://blog.csdn.net/slowgrace/archive/2008/12/08/3478520.aspx

1. Concept of multiple nodes

The same node may be attached to multiple locations in the same tree. For example, "zucchini fried beef" may be attached to the vegetable category or the Meat category. We call this nodeMultiple hanging nodes in the same treeIn addition, the same node may also be attached to multiple trees. For example, a time record can be attached to a project tree as the minimum task unit of the project, it can also be hung under the activity tree as the smallest unit of time statistics. We call this nodeMultiple nodes with different trees. Multiple nodes can be hung under multiple trees. We say multiple nodes have multipleDongjiaEvery East house is a tree.

The existence of multiple hanging nodes leads to the issue of multi-Tree Association. The so-calledMulti-tree LinkageIt means that when multiple hanging nodes on a tree are deleted, modified, and dragged, all the East trees of the node need to be changed accordingly. The event mechanism can be used to solve the problem of multi-tree linkage.

Multi-node mounting will not only cause multi-tree linkage issues, but also bring about a series of new "scientific research projects", such ......

2. Basic node Concept

Basic NodeThese nodes are mostly basic data, data that will never be deleted, and accumulated data, such as activity records in timetrack and accounts in wealth management software; an article in information management software. They can be collected by multiple different trees as their leaf nodes. They are the bottom-layer non-Abstract nodes. Sometimes they are multiple nodes, but sometimes they are always leaf nodes. In most cases, they do not need to be deleted. The significance of their existence lies in providing the most basic information for various statistics. They record the development process of the entire transaction in the most loyal, fine-grained, and sequential manner.

3. Data structures related to multiple hanging nodes and Basic Nodes

The most accurate way to determine whether a node is a basic node is to go to the tblfundtable table to see if there is any detailed table name for this node.

Different from the basic node, multiple nodes are not identified in the whole table, that is, in the same detail table. Some nodes may be multiple nodes, and some may not. They must be specified by the user. Therefore, the most accurate way to determine whether a node has more hanging nodes is to traverse all tree tables and check whether the node has more hanging nodes. Obviously, this is too heavy. A solution is to arrange a field in a table to indicate whether the node is suspended. This field can be arranged in the node table or in the node detail table. For multiple nodes, if this field is arranged in the node table, there will be information redundancy (because the node is to be hung in multiple places), so this field is arranged in the node detail table.

More tree articles