Changes between Version 2 and Version 3 of DataStructures

Timestamp:

Jun 29, 2006, 3:14:16 PM (18 years ago)

Author:

soujak

Comment:

--

DataStructures

@@ -55 +55 @@
 BST's height in a determining way, deciding tree balance, making ''O(log(n))''
 an estimate of the average case cost. In particularly adverse situations BSTs
-collapse into a ''f**ked/s**t'' list.
+collapse into a ''f**ked'' list.
 [[BR]]
 Summing up, in order to appreciate BSTs performance improvements and scalability,
@@ -65 +65 @@
 Therefore we tried to limit wastes, just single-linking the tree with `s_rightC`
 and `s_leftC` pointers, increasing module complexity and consequent
-implementation and mantainance [wiki:doc/devel difficulties].
+implementation and mantainance [wiki:Design&Hacks#a1.Modulesdesign difficulties].
 
 {{{