I have studied java, and done several projects, but the foundation is poor, I can only sort simply, I have not systematically learned computer knowledge, and I have data structures and algorithms. Can I do letcode and learn at the same time? ...
A red-black tree can be equivalent to a fourth-order B-tree, and all kinds of operations of the fourth-order B-tree can be completed in log (n) time, so what is the meaning of the red-black tree? Or is there such an essential difference between them that...
this is the insert function of the array linear table written in CPP. In the second if condition, there is no problem if you use listSize+1, but there is an error (non-compilation error) if you execute the listSizePP program . void insert(int location, ...
there is a balanced binary tree. How to ensure balance by adding 2 new nodes? for example, the weights are as follows: 100, 92, 86, 56, 6, 10, 90 , how to build a balanced binary tree? ...
given a pointer p, how do I delete the node pointed to by a single linked list p? ...
Today on the data structure, the teacher said that there are four physical structures, sequential structure, chained structure, index and hash, but the book says that there are only sequential and chained structures. So who s right. ...
learn to forget one at a time. Is there anything you can do to play with? to master it thoroughly ...