- 博客(7)
- 收藏
- 关注
RSS订阅原创 !!!Chapter 12 Advanced Data Structure and Implementation
12.2 Red Black TreeOperations on red black trees take O(logN) time in the worst case, and a careful nonrecursive implementation can be done relatively effortlessly.A red black tree is a binary sea
2013-08-15 09:28:00
761
原创 !!!Formal Parameter & Actual Parameter & Pointer (形参， 实参， 指针)
Formal Parameter vs Actual ParameterFormal Parameter: 形参Actual Parameter: 实参The term parameter (sometimes called formal parameter) is often used to refer to the variable as found in the functi
2013-08-15 01:58:11
1379
原创 KNOW: Tree, Trie, Graph
Binary TreeA binary tree is a tree in which no node can have more than two children.The depth of an average binary tree is considerably smaller than N.For binary search tree, the average dep
2013-08-14 02:56:31
816
原创 KNOW: Bit Manipulation
Bit Manipulation types~bitwise NOT~expr>left/right shiftexpr1 &bitwise ANDexpr1 & expr2^bitwise XORexpr1 ^ expr2|bitwise ORexpr1 | expr21. l
2013-08-06 22:19:47
688
原创 KNOW: Hash Table
CH 5 in DS and AADefinitionIn computing, a hash table (also hash map) is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a h
2013-08-06 05:30:06
543
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人