摘要: Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and ino 阅读全文
posted @ 2018-08-26 23:01 赖兴宇 阅读(224) 评论(0) 推荐(0) 编辑
摘要: The following is from Max Howell @twitter: Now it's your turn to prove that YOU CAN invert a binary tree! Input Specification: Each input file contain 阅读全文
posted @ 2018-08-26 22:24 赖兴宇 阅读(513) 评论(0) 推荐(0) 编辑
摘要: 结构体自定义运算符 STL的使用 一. 二叉树相关: 前序, 中序, 后序, 层序遍历结果,分别用pre, in, post ,level表示的数组来记录 001.1020 Tree Traversals (25) https://www.cnblogs.com/mr-stn/p/9214298.h 阅读全文
posted @ 2018-08-26 18:41 赖兴宇 阅读(311) 评论(0) 推荐(0) 编辑