Recent Blog Entries
Recent Status Updates
"Being deeply loved by someone gives you strength, while loving someone deeply gives you courage." - Lao Tzu
after 3 Weeks of working on computers for 8 hours a day and writing PHP for 8 hours at night; it's time to start writin an admin panel for all this in C.
I think it is time for a sleep after a long testing and frustration.
- Managed C++
- Visual Basic 4 / 5 / 6
- linked list
- hello world
Posted 07 May 2010 - 08:46 AM
with this problem...if yu have any ideas help me
Neighbours: Two nodes are neighbors if they share the same father and does not interfere with node
between the pipes. The blue nodes are neighbors but not orange
Scalable: A 2-3 tree is scalable if it contains two neighbors where they have three children each
Extension: If a tree is scalable get two neighboring nodes with three children each and
transformed into three nodes with two children.
Implementation: implement the following operations in a 2-3
empty (): returns true if and only if empty
contains (x): returns true if and only if it contains the value of x.
insert (x): inserts the integer x in the tree
isExpandable (): returns true if and only if the tree is extensible
expand (): expand the tree (it is call the method immediately after when isExpandable ()
numberOfNodes (): returns the number of nodes
toIntArray (): returns an array of int containing all the tree values in ascending
The Last Two methods are implemented by recursive function calls
Posted 09 May 2010 - 02:47 PM
Posted 21 May 2010 - 08:57 AM
He also gave a talk at the 2008 International Conference on the Analysis of Algorithms in Maresias, Brazil. A copy of his presentation, in pdf format, is available from
I was so impressed by the presentation that I implemented the algorithm as a PHP abstract class. The code is available from
LLRB Tree (tree, binary tree) - PHP Classes
Hope that this helps. If it does not provide an immediate solution, perhaps it will provide additional insight for you.