Programming VIP

1, Principle of cued binary tree Introduced earlier Binary tree The article mentioned that the binary tree can use two storage structures: sequential storage and chain storage. When using chain storage, there will be a large number of empty finger needle fields. In order to make full use of these empty finger needle fields, a cued binary t ...

1. Establish the chain storage structure of binary tree (bracket representation) Algorithm idea: ① If ch = '(': it means that the node p just created has child nodes, and it needs to be stacked as the top node of the stack in order to establish the relationship between it and its child nodes (if a node has just been created, and the subsequ ...

Binary tree 1. Tree structure 1.1 concept Tree is a nonlinear data structure. It is a set with hierarchical relationship composed of n (n > = 0) finite nodes. It is called a tree because it looks like an upside down tree, that is, it has roots up and leaves down. It has the following characteristics: There is a special node, called t ...

Data structure ~ basic 2 ~ tree [design of binary tree, binary search tree, AVL tree, B tree and red black tree] ~ red black treehttps://www.cnblogs.com/shan333/p/15496806.html I   Red black tree: ☼   Introduction to red black tree: -----------Morphologically, it is a special binary search tree [specially reflected in color, an ...

Binary tree isomorphism Isomorphism of tree: Give two trees T1 and T2. If T1 can be changed into T2 by several times, we call the two trees "isomorphic". For example, the two trees given in Figure 1 are isomorphic, because we exchange the left and right children of nodes A, B and G of one tree to get the other tree. Figure 2 is not ...

1, Tree A tree t is a set of non empty finite elements, one of which is the root, and the other elements form the subtree of t. As shown in the figure: Each element represents a node. The tree root is painted on the top and its subtree is painted on the bottom. There is an edge between the root and the root of the subtree. Similarly, each ...

catalogue 1, Pile 1. Concept of heap 2. Nature of heap 3. Heap classification 2, Downward adjustment algorithm of heap 3, Heap creation   4, Heap up adjustment algorithm 5, Implementation of heap 1. Heap initialization 2. Heap destruction 3. Heap insertion 4. Deletion of heap 5. Get data from the top of the heap 6. Number of ...

1. Tree structure 1.1 concept (understanding) The tree is no longer a one-to-one linear structure such as sequential list, linked list, stack and queue. The tree is a one to many data structure, which consists of n (n > = 0) disjoint finite node groups and hierarchical sets The features are as follows: There is a special node, called ...

Binary tree is a very, very important part of data structure. As the saying goes, if you don't know the Great Wall, you don't know the data structure. What is a binary tree? We have learned about the linked list before, but when we use it, we will find a problem that each node of the linked list can only point to one node in the same direction, ...

1. Definition of heap A heap is a special kind of complete binary tree in which the father node must be greater than or equal to its child node (this is called a heap) or the father node must be less than or equal to its child node (this is called a heap). _The so-called complete binary tree is a kind of binary tree whose nodes are arrang ...