Programming VIP

catalog: I Concept & principle Previously, we understood the binary search tree, but we found that if the data is orderly or close to orderly, the binary search tree will degenerate into a single tree AVL tree is a balanced binary tree. It just adds a balance factor to the binary search tree to form the current balanced bi ...

catalogue Title: Sword finger offer03: repeated numbers in the array Title: Sword finger offer04: search in two-dimensional array Title: Sword finger offer05: replace spaces Title: Sword finger offer06: print linked list node information from end to end Title: Sword finger offer07: reconstruction of binary tree (pre order + middle order) ...

AVL tree introduction and detailed explanation of each operation Introduction to AVL treeImplementation of AVL tree operation set rotate RR insertion (left single rotation)LL insertion (right single rotation)RL insertion (right left double rotation)LR insertion (left and right double rotation) insertdeleteergodic Complete code Code ...

This article is long. You can click the directory below to view the corresponding content. I tree 1. Basic concepts    tree is a nonlinear data structure, which consists of n nodes and a set with hierarchical relationship. In fact, it is a big tree growing upside down, with many leaves added to one root.   the tree must con ...

1. Title Given two integer arrays inorder and postorder, inorder is the middle order traversal of the binary tree and postorder traversal of the same tree, please construct and return this binary tree. Example 1: Input: inorder = [9,3,15,20,7], postorder = [9,15,7,20,3] Output:[3,9,20,null,null,15,7] Example 2: Input: inorder = [-1 ...

Binary search tree concept Binary search tree, also known as binary sort tree, is either an empty tree or a binary tree with the following properties: If its left subtree is not empty, the value of all nodes on the left subtree is less than that of the root nodeIf its right subtree is not empty, the value of all nodes on the right subtree is ...

1, Key analysis 1. Insert node Inserting a node is relatively simple. You only need to judge the key value, replace the corresponding key value, or create a new key value. // Insert the node (key, value) into the binary search tree with node as the root, and use the recursive algorithm // Returns the root of the binary search tree ...

preface: ·The depth first traversal and width first traversal of binary tree are the basis for solving the problem of binary tree. Mastering the common traversal methods of binary tree can make us solve the problem of binary tree more handy. catalogue preface: Recursive form of pre -, middle - and post order traversal of binar ...

1, Types of binary trees 1. Full binary tree Except that the last layer has no child nodes, all nodes on each layer have two child node binary trees (if the depth is k, there are 2^k-1 nodes). 2. Complete binary tree Let the depth of a binary tree be H. Except for layer h, the number of nodes in other layers reaches the maximum, and all n ...

I Sequential search The principle is to find = = one by one. The code is as follows int order_search(char *p){ int i = 0; while(i<3367 && strcmp(p,word[i])>0){ i++; cnt++; } cnt++; //printf("%d\n",cnt); if(strcmp(p,word[i])==0) return 1; else return 0; } Efficiency analysis: Average search length ASL: (1+...+n)/n = ...