data structure
First, introduce the red black rules of red black tree Each node is either red or black The root node must be black If a node has no child node or parent node, the corresponding pointer attribute value of the node is Nil. These Nils are regarded as leaf nodes, and each leaf node (Nil) is blackUTF-8...
Posted by RavenStar on Sun, 10 Oct 2021 13:36:22 +0530
Continue to enjoy your weekend afternoon blog and go running after it. 1. Balanced binary tree Balanced binary tree, either it is an empty tree, or its left and right subtrees are balanced binary trees, and the absolute value of the depth difference between the left subtree and the right subtreUTF-8...
Posted by qingping on Sun, 10 Oct 2021 14:12:32 +0530
3. Linked list Why do I need a linked list The construction of sequence table needs to know the data size in advance to apply for continuous storage space, and the data needs to be relocated during expansion, so it is not very flexible to use. Linked list structure can make full use of computerUTF-8...
Posted by BioBob on Sun, 10 Oct 2021 17:43:43 +0530
Catalog Recursive traversal Pre-order recursive traversal Intermediate and subsequent recursive traversal Non-recursive traversal Recursive traversal Pre-order recursive traversal Start with a simple start class Solution { public List preorderTraversal(TreeNode root) { List rUTF-8...
Posted by api on Sun, 10 Oct 2021 22:13:38 +0530
Describe the operation of the time wheel against the background of the clock. The time wheel moves one space at a time, like a clock scale. ++ tick 60; per second++ tick describes the movement of the second hand; pair to keep the second hand moving between [0,59]; For a clock, its time precisioUTF-8...
Posted by Hybrid Kill3r on Sun, 10 Oct 2021 22:46:32 +0530
subject describe one General description Candidates need to simulate and implement a simple vending system to realize the functions of coin insertion, commodity purchase, coin return, query of inventory commodities and deposit box information. During system initialization, there are 6 kinds of UTF-8...
Posted by Vibralux on Mon, 11 Oct 2021 04:18:30 +0530
10.3 threaded binary tree 10.3.1 let's look at one question first The sequence {1, 3, 6, 8, 10, 14} is constructed into a binary tree. n+1=7 Problem analysis: When we traverse the above binary tree in middle order, the sequence is {8, 3, 10, 1, 6, 14}However, the left and right pointers of 6, 8UTF-8...
Posted by s3rg1o on Mon, 11 Oct 2021 05:41:31 +0530
1. Header file #include #Include < stdlib. H > / / functions for malloc and free #Include < stdpool. H > / / for header files with true and false Note: if true and false are changed to 1 and 0, you do not need #include < stdpool. H >; 2. Declaration There are many different ways of wrUTF-8...
Posted by Awesome Trinity on Mon, 11 Oct 2021 22:52:26 +0530
Application of queue The application of queue is mainly reflected in four aspects: 1. Solve the problem of mismatch between computer host and peripherals, 2. Solve the problem of resource competition caused by multiple users, 3. Simulate discrete events, simulate various queuing problems in praUTF-8...
Posted by kristalys on Tue, 12 Oct 2021 01:12:34 +0530
array Definition of array An array is an ordered collection of data of the same type Array declaration creation Array variables must be declared before they can be used in programs int[] array; //Preferred method int array[]; The new operator is used in the java language to create arrays int[] UTF-8...
Posted by adamjones on Tue, 12 Oct 2021 03:57:14 +0530