Naive Trees - Path Enumeration, Insert Leaf
02 Apr 2013, 12:42
Volker Flormann (1 post)
I just got the book and started reading. And I have to admit I am a beginner in SQL and stuff like that. I came across a part where you do some operations on the path-enum implementation of the naive tree. There (page 31/32 paper version p3.0) it is said that inserting a nonleaf node is an easy operation. Is this a typo? The following code isn’t inserting a nonleaf node, if I am correct, and to inserting such a nonleaf node isn’t a simple operation here either. Should this ‘new leaf’ instead of nonleaf?
Is it still useful if I put stuff like this in the errata section?
Anyway, looking forward for more dont’s I already have done.
|You must be logged in to comment|