树形结构-二叉树
关注
分享
扫一扫
conquerheaven
这个作者很懒，什么都没留下…
展开
-
uva 10701(简单二叉树)
Problem F - Pre, in and postTime Limit: 1 secondA common problem in data structures is to determine the traversal of a binary tree. There are three classic ways to do it:Pre-order: You mus原创 2013-10-11 16:24:53 · 766 阅读 · 0 评论 -
uva122（不用二叉树也能做）
Trees on the level BackgroundTrees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat tr原创 2013-10-11 17:09:11 · 1266 阅读 · 0 评论