二叉查找树(Binary Search Tree)
今天下午闲着无聊，复习了一下“二叉查找树”，并用代码温习了一下。 对于二叉查找树，一般支持的操作有：查找关键字，最大值，最小值，前驱和后继等等的查询，对于高度为h的树，它们都可以在O(h)时间内完成。 BinaryTree.h 测试BST 参考资料：算法导论P151-P158
About Me
A game developer, a music lover, plus a partisan fan of F.C. Barcelona
Categories
- In My Life (28)
- A Day in the Life (8)
- Daze Of Nothing (2)
- English Learning (2)
- Learn a Word (7)
- Something In The Way (7)
- Music Heaven (16)
- Guitar (1)
- In Concert (1)
- Lyrics (4)
- My Video (7)
- OK Computer (52)
- 3D (2)
- C++ (10)
- Computer Graphics (15)
- Game Programming (21)
- iOS (5)
- Linux (1)
- Lua (8)
- My Projects (3)
- Some Experiences (8)
- Talking in Code (2)
- Unity (1)
- Quotations (2)
- Visca Barça (24)
- FCB BJ (5)
- In My Life (28)
-
Recent Posts
Recent Comments
Blogroll
Tags
2d 3D 3dsmax 3ds max air Apply architecture Asia tour barca Beijing bilbao binary search blocked blowing in the wind blues bob bob dylan boost C++ Champions League DLL DX10 eval exporter flash framework frustum culling game game engine guitar iniesta ios linux lua Moai opengles pacman plug-in plugin 北京 导出插件 崩溃 巴萨 游戏引擎 踢球LinkedIn
Weibo