tags:

views:

70

answers:

3
Q: 

Non-BTree data structure where inserts are done in a sorted manner but i can later remove objects from random places

i want to find an object with O(logN) and also remove with O(log N) - but no go to balanced tree implementation..

any idea's for that?

+1  A: 

B-tree

Ignacio Vazquez-Abrams  2010-10-10 11:58:10
+1 for answering the question in the title, -1 for ignoring that the questioner (without giving any reason) specified no balanced tress.
Steve Jessop  2010-10-10 12:58:11
+1  A: 

Fenwick tree

Armen Tsirunyan  2010-10-10 11:58:21
A: 

Yes, use a skip-list. It's probabilistic data-structure with logarithmic insertion/search/removal, but without the complex balancing code of trees.

zvrba  2010-10-11 06:40:59

related questions

Of Memory Management, Heap Corruption, and C++
How do I make a GUI?
Alpha blending sprites in Nintendo DS Homebrew
Thread safe lazy contruction of a singleton in C++
Interview Programming Questions - In house Exam
Link issues (VC6)
What are the barriers to understanding pointers and what can be done to overcome them?
Why are professors or schools picking Java over C++ to teach to students?
What is the best way to create a sparse array in C++
C/C++ library for reading MIDI signals from a USB MIDI device
How do you pack a visual studio c++ project for release?
How to set up unit testing for Visual Studio C++
How do I configure and communicate with a serial port?
Lightweight IDE for Linux
Mapping Stream data to data structures in C#
CPU throttling in C++
Asynchronous multi-direction server-client communication over the same open socket?
Exceptions in C++
Heap corruption under Win32; how to locate?
Build for Windows NT 4.0 using Visual Studio 2005?
C++: Should I use nested classes in this case?
BerkeleyDB Concurrency
GTK implementation of MessageBox
Is gettimeofday() guaranteed to be of microsecond resolution?
How to use the C socket API in C++ on z/OS