我是正常蛇

  博客园  :: 首页  :: 新随笔  :: 联系 :: 订阅 订阅  :: 管理

2012年9月6日

MIT 算法导论 （九）Binary Search Tree
摘要： What is it?If a binary tree who's node's value in left child tree is all smaller than root and the node's value in right child tree is all greater than root , and it also holds for any subtree in this tree, then this is a binary search tree.If we perform an inorder tree walk of T , which 阅读全文
posted @ 2012-09-06 16:45 我是正常蛇 阅读(340) 评论(0) 推荐(0)