Shulou(Shulou.com)06/02 Report--

This article mainly introduces "C#data structure and algorithm tree what role", in daily operation, I believe many people in C#data structure and algorithm tree what role there is doubt, small editor consulted all kinds of data, sorted out simple and easy to use operation method, hope to answer "C#data structure and algorithm tree what role" doubt helpful! Next, please follow the small series to learn together!

C#data structure and algorithm tree

First, under win, enter the command line and enter tree, which will return all the subfolders and files under the current folder in the form of a tree.

The picture above is a tree.

Like an inverted apple tree, each element is called a node, as shown in the figure, A is the oldest of the tree, called the root (root), if a node has elements, this node is the root relative to its child nodes, this tree is its child tree relative to A, for example, tree D is A's child tree.

A node without children is called a leaf node.

The roots of these trees are connected by each directed edge from the heel. For example, tree E is connected by a directed edge TAE from root A. Tree J is connected by directed edges TEJ from root E.

The sequence of nodes from one node to another is called a path, and the number of entries on the path is the length of the path. It can be seen that the length of the path is the number of nodes it passes through minus one. For example, the path EQ has a length of 2.

Depth is the length of the path between the root node and this node. For example, the depth of nodes P and Q is 3, and the depth of node K is 2.

C#data structure and tree representation of algorithms

C#data structure and algorithm can be used to represent a tree linked list. As shown in the figure:

As shown in the figure, A is *** elements of the linked list, G is an element of ***, if the element has child nodes, then this element is the linked list of this tree.

As the arrow points out, ABCDEFG is a linked list, and the node DEFG is a tree with child nodes, so DEFG elements store another linked list, such as E stores an EIJ linked list, and so on, J stores a JPQ linked list, so no matter how deep a number is, it can be represented by a linked list, but this linked list contains other linked lists.

At this point, the study of "C#data structure and what role trees play in algorithms" is over, hoping to solve everyone's doubts. Theory and practice can better match to help everyone learn, go and try it! If you want to continue learning more relevant knowledge, please continue to pay attention to the website, Xiaobian will continue to strive to bring more practical articles for everyone!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.