are there any news on this subject?
does it work now?
Search found 3 matches
- Fri Oct 26, 2007 12:38 am
- Forum: Bugs and suggestions
- Topic: 10750 - Beautiful Points
- Replies: 7
- Views: 4650
- Thu Nov 23, 2006 1:52 pm
- Forum: Bugs and suggestions
- Topic: judge not ready ?
- Replies: 4
- Views: 2557
- Sun Jun 11, 2006 2:17 pm
- Forum: Bugs and suggestions
- Topic: 10303 - irritation in the problem statement
- Replies: 5
- Views: 3529
10303 - irritation in the problem statement
the problem statement says, a binary search tree is a data structure, which can find a node in O(n log n). Of course this is a true statement (because of the O-symbol), but even with the worst case tree, one can find any node in O(n). If the tree is balanced it's even O(log n).