摘要:
Falling LeavesTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionFigure 1Figure 1 shows a graphical representation of a binary tree of letters. People familiar with binary trees can skip over the definitions of a binary tree of letters, leaves of a binary tr 阅读全文
posted @ 2013-04-24 23:15
程序流程图
阅读(191)
评论(0)
推荐(0)
摘要:
二叉搜索树Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1849Accepted Submission(s): 827Problem Description判断两序列是否为同一二叉搜索树序列Input开始一个数n,(15放在5的右儿子,7>5,7>6,所以放5的右儿子的右儿子,4
#include
#include
#define MAXN 30 int TOrder[MAXN], cnt = 0; typedef struct 阅读全文
posted @ 2013-04-24 23:09
程序流程图
阅读(472)
评论(0)
推荐(0)

浙公网安备 33010602011771号