This is an overview of the knowledges in chapter 1.

The pre-knowledges you should know is priority of operator. Priority is the rule that determines when we meet two operators, which to calculate first. Like 3+2*5, we calculate 2 * 5 first.

The priority of operators are:

There are mainly three ways of binary tree traversal. In-order, Preorder and Post-order.

For example we have a simple three-node tree like this.

Assume that we have a bunch of points, each point has a number means the occurrence times of the point.

I’ve been studying Data Structure for a while and now I sum up some knowledges.

Here are some symbols that are not used very usual and how to type it in LaTex.

The code of the bouncing all and more projects.

I’ve learnt Processing JavaScript a little and have some complete projects. They are very simple but I think they are not ugly.

In order to post my note of linear algebra, I need to know how to put matrix using LaTex. The followings are the usage.

To describe supervised learning,we establish notation for future use.

**$x^i$ **denote the input variables also called input features

**$y^i$ ** denote the output variables also called target variables that we are trying to predict.

A pair **($x^i, y^i$) **is called a training set.

Every time I use find function in C++ , I always search its usage after using it for so many times. So I decide to make a summary of some commonly used usages.

KMP is an algorithm that find the given pattern string in the pending string. Usually we would think of violent traversing the two strings using for loop. However the time complexity of this method is O(n)~O(mn). So the KMP can cut the times of loop.

Because of my first theme was so incomplete that I need to add many features myself. So I’ve looked for how to add comment system on the blog.

Last time I‘ve talked about how to build your own blog, however, the original theme might not very beautiful to you. So this time I would write how to change your blog theme and others.