Talk:TADM2E 3.13
From Algorithm Wiki
Revision as of 23:07, 11 January 2015 by NullObjectPtr (talk | contribs) (Created page with "Doesn't this solution violate the condition that we are restricted to O(n) memory usage? If the tree has N leaf nodes, and is a perfectly balanced binary tree, there would be...")
Doesn't this solution violate the condition that we are restricted to O(n) memory usage? If the tree has N leaf nodes, and is a perfectly balanced binary tree, there would be a total of N log N nodes and O( n log n ) memory used. Correct?
