[algogeeks] Call for Papers with Extended Deadline of Mar. 10, 2008: The 2008 International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government (EEE'08), USA, July

Dear Colleagues: I would appreciate if you would share the announcement below with those who might be interested. Best regards, A. M. G. Solo Publicity Chair, EEE'08 --- Extended Paper Submission Deadline: March 10, 2008 C A L LF O RP A P E

[algogeeks] Re: finding kth smallest node in binary search tree

If the tree is balanced, and if you store the number of nodes in the subtree rooted at each node in the tree, it can be achieved in O(log n). It is tree to verify that this extra information can be maintained with all insert, del operations at no extra cost. On Feb 28, 11:36 am, "Lego Haryanto" <