Binary Tree Traversal
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.
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.
The core of the problem is Dichotomy which is Binary search the best range of the X.
For me, the core of the problem is to figure out how the matches carry on exactly. It's the hardest part for me.
Position of the house can be divided into two situation, Uphill slope and Downhill slope. And the two situations are used to calculate the Y position of the house.
From the description above we can draw that the Voronoi Diagram is drawn not casually but with some rules and the role can only correspond to one kind of the diagram.
Using C/C++ we can’t calculate very big number of prime factors. So we use string to store it.
The problem A+B is probably the easiest problem, however, the maxim number C/C++ can calculate is between -9223372036854775808~9223372036854775807. The bigger number can’t be calculate unless you use Python or Java. So I’m going to introduce a way to calculate the big number of A+B.
Here are some symbols that are not used very usual and how to type it in LaTex.