Programmer Think

We are already familiar with the basic routine of binary tree. Next, let's talk about the recursive routine of binary tree, which can solve most binary tree problems in the interview, especially the tree dp problem. Its essence is to use the convenience of recursion to traverse binary tree.Judge whether the binary tree is a complete binary tree ...

Next blog: C brush question: LeetCode 752 Open the turntable lock (medium) | BFS wide search detailed explanation (1) Hash version Add HASH data structure, be familiar with the use of uthash, and add constraints. Main constraints: Do not turn back, for example, if you turn forward once, you are not allowed to turn backCan't cross dean ...

Definition of linear table Linear table: a finite sequence of zero or more data elements. The number n of linear table elements is defined as the length of the linear table. When n is 0, it is an empty table. In a complex linear table, a data element can be composed of several data items. Storage structure of linear table Sequential storag ...

Select sort Sorting principle: During each traversal, it is assumed that the element at the first index is the minimum value, which is compared with the values at other indexes in turn. If the value at the current index is greater than the value at some other index, it is assumed that the value derived from some other index is the minimum val ...

The sorting time complexity of bubbling, insertion and sorting is O(n2), which has high time complexity and is suitable for small-scale data processing. For large-scale data sorting, merge sorting and quick sorting are more suitable. Both merge sort and quick sort use the idea of divide and rule. Merge sort The idea of merging and sorting ...

In programming life, we always meet tree structure. These days, we just need to operate the tree structure, so we can record our own operation mode and process. Now suppose there is such a tree, (it doesn't matter whether it is a binary tree or not, and the principle is the same) 1. Breadth first traversal The English abbreviation is BFS, th ...

A. metal collection Searched. It's found that it's a tree dp. This thing really doesn't, and it hasn't been done... So I can't understand it for the time being.. B solution of univariate cubic equation Solution idea: use floating-point numbers to enumerate from negative numbers to positive numbers. According to the position of t ...

Question 1: merging binary trees LeetCode 617 : Merge binary tree Description: Given two binary trees, imagine that when you overlay one of them on the other, some nodes of the two binary trees will overlap. You need to merge them into a new binary tree. The merging rule is that if two nodes overlap, their values are added as the new value ...

Training project - personal information management system preface This blog records the training project summary of rookie (I @~@) at the end of freshman year. It has been approved by the project team members before publication. Please keep the statement for reprint. Thank you. The main purpose of the project is to strengthen the abili ...

Experimental preparation: 1. Skillfully use pointer for program design and master structure pointer. 2. Master the use of structure pointer to access structure variables. 3. Master the use of pointers as function parameters. 4. Understand the meaning, purpose and processing method of tree and binary tree. 1, Experimental purpose Understand a ...