随笔分类 -  Cracking the Coding Interview

LALAHALAHA
《Cracking the Coding Interview 》之 二叉树的创建 与 遍历(非递归+递归version)
摘要：#include #include #include #include #define ls(x) (((x + 1)v, int cur) { rt -> val = v[cur]; if (ls(cur) left = newNode; createBTree(rt -> left, v, ls(cur)); }if (rs(cur) r... 阅读全文

posted @ 2016-12-24 21:28 暴力的轮胎 阅读(164) 评论(0) 推荐(0)

导航