Programmer Think

The basic operations of Binary Search Tree include search, maximum, minimum, previous, subsequent, insert and delete. The time spent on the basic operation of the binary search tree is proportional to the height of the tree. For example, for a complete binary tree with n nodes, the time complexity of the basic operation on it is O(logn). Howev ...

The number baseball game is played in this way: first, a thinks of a four digit number in his mind, such as 3092. If it is less than four digits, it is supplemented by 0. For example, 12 is considered to be 0012. This number is called the target. B guesses the number. The method is like this. He first randomly says a number to a, such as 5382. ...

1. Stack 1.1 definition of stack Stack is a linear table that is restricted to insert and delete operations only at the end of the table We call the end that allows insertion and deletion as the top of the stack and the other end naturally as the bottom of the stack; A stack without data elements is called an empty stack; The stack is cha ...

tree A tree of nonlinear structures in the logical structure of data Definition of tree (cycle definition): (1) There is only one root node (2) There are m disjoint trees except the root node, which are called subtrees.Tree representation Basic terms of trees Node: an independent unit in a tree. Contains a data element and sev ...

tree Tree is a nonlinear data structure. In the tree, each node contains its own value and its connected child nodes. The line connecting the nodes is called edge. As shown in the following figure, a is the root node and the parent node of B and C, that is, both B and C are child nodes of A. Similarly, B is the parent node of D and E, a ...

2022 winter vacation LeetCode question brushing - task 01: linked list Introduction: the author is basically Xiaobai, so this topic brushing meeting is a difficult process. At the same time, it is also through this team learning to pick up the previous knowledge, and more importantly, it is to expand and consolidate. Therefore, this blog may b ...

1. Introduction to JavaScript 2. ECMAScript and TypeScript overview 2.2.7 object oriented programming using classes class Book { constructor(title, pages, isbn) { this.title = title this.pages = pages this.isbn = isbn } printTitle() { console.log(this.title) } } let book = new Book('title', 'p ...

General classification: Internal sorting The amount of data is small, and all data can be sorted in memory. All sorting in this paper is from small to large 1. Insert sort Insertion sort is one of the simplest sorting methods. In order to ensure the efficiency of random access, insertion sort should use array structure to complete ...

1, Sequential storage of binary tree 1.1 storage mode Use the array to save the binary tree structure, that is, the binary tree is put into the array by sequence traversal. Generally, it is only suitable for representing complete binary trees, because incomplete binary trees will waste space. The main use of this approach is the represe ...

The idea of this paper is as follows: 1: What is a circular linked list and where is it used? 2: How to construct a ring linked list 3: Double pointer to solve the problem of circular linked list 4: Summary 5: Share songs Note that this article only talks about the circular linked list composed of single linked list What is a circular linked l ...