不慌不忙、不急不躁

ExpressionsArithmetic expressions are usually written with the operators in between the two operands (which is called infix notation). For example, (x+y)*(z-w) is an arithmetic expression in inf

Tree You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value o

题目链接：hdu 3791 二叉搜索树题目大意：中文题，略。解题思路：先建树，然后比较各个对应位置上的值是否相同。#include #include struct Node{ int val; Node* left; Node* right; Node(){ val = 0; left =

题目连接：poj 1785 Binary Search Heap Construction题目大意：给出一些节点，每个节点包括label  和 priority， 需要将这些节点排成一颗笛卡尔树（按照label为一颗二叉搜索树，按照priority为一个堆，数值大的一定在树的上层）。解题思路：一开始按照自己的想法，将节点按照priority的大小排序，从大到小，然后按照建二

题目连接：hdu 1671 Phone List题目大意：给出n个电话号码，判断是否存在某个电话号码是另外一个电话号码的前缀。解题思路：建一个二叉树进行搜索时的优化。#include #include #define min(a,b) (a)<(b)?(a):(b)const int N = 50;int n, flag;struct node

Tree Recovery Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.This is an

The Falling Leaves Each year, fall in the North region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the tr

S-Trees A Strange Tree (S-tree) over the variable set  is a binary tree representing a Boolean function. Each path of the S-tree begins at the root node and consists of n+1 nodes. Ea

Not so Mobile Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of mobile is usually found

test#include#include#includeusing namespace std;#define N 10000int sum;char *move;void build(int n);int cut(char *t,int f) // 对 'p' 与 'f' 相遇时，'p'的后续子树进行删除{ for(int i=0;

Tree Summing BackgroundLISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which are th

题目链接：hdu 5444 Elven Postman其实就是一棵二叉搜索树，建完树遍历一下每个节点ans串就出来了。#include #include #include #include #include #include #include using namespace std;typedef long long ll;const int maxn