FAQs
Search
Recent Topics
Flagged Topics
Hot Topics
Best Topics
Register / Login
Post Reply
Bookmark Topic
Watch Topic
New Topic
programming forums
Java
Mobile
Certification
Databases
Caching
Books
Engineering
Micro Controllers
OS
Languages
Paradigms
IDEs
Build Tools
Frameworks
Application Servers
Open Source
This Site
Careers
Other
all forums
this forum made possible by our volunteer staff, including ...
Marshals:
Campbell Ritchie
Liutauras Vilda
Bear Bibeault
Junilu Lacar
Martin Vashko
Sheriffs:
Jeanne Boyarsky
Tim Cooke
Knute Snortum
Saloon Keepers:
Ron McLeod
Tim Moores
Stephan van Hulst
Tim Holloway
Carey Brown
Bartenders:
Scott Selikoff
salvin francis
Piet Souris
Forums:
General Computing
Go
Which data structure is good for ordered scanning of data ?
Ojas Jain
Greenhorn
Posts: 7
posted 4 months ago
Which data structure is good for ordered scanning of data ?
Bhagvan Kommadi
Author
Posts: 75
5
posted 4 months ago
T-tree is a balanced data structure which has actual data in memory and index. It is used for ordered scanning of data.
Can you really tell me that we aren't dealing with suspicious baked goods? And then there is this tiny ad:
Java file APIs (DOC, XLS, PDF, and many more)
https://products.aspose.com/total/java
Post Reply
Bookmark Topic
Watch Topic
New Topic
Boost this thread!
Similar Threads
* Welcome Bhagvan Kommadi
Learn Data Structures and Algorithms with Golang: Tree Data Structures
Learn Data Structures and Algorithms with Golang: Cryptography
Learn Data Structures and Algorithms with Golang: College Reference?
How can one improve performance of the applications using data structures and algorithms?
More...