Data structure in C++


Interview questions
C++ interview C interview C test! Test C++ skills New Data structure test New Test Java skills New Download C++/Oracle FAQ Data structure test! C++ access control C++ COM C++ constructors destructors C++ containers C++ DCOM C++ derived class C++ error handling C++ exception handling C++ friend members C++ inheritance C++ inline function C++ memory leaks C++ namespaces C++ new and delete C++ operator overloading C++ pointers C++ references C++ static data C++ syntax C++ template C++ type checking C++ virtual functions C++ pure virtual functions C++ as an object-oriented More concept of C++ C++ data types C++ control constructs C++ collections C++ functions C++ arrays C++ C-string C++ class and structure C++ friend functions C++ polymorphism C++ multiple inheritance C++ function template C++ class templates C++ standard stream class ATL server Data structure in C++

Data structure in C++

<<Previous Next>>

C++ Data structure in C++ - Feb 23, 2010 at 11:00 PM by Rajmeet Ghai

What are the advantages and disadvantages of B-star trees over Binary trees?

Advantages:
B-star trees offer a faster and better search as compared to binary trees. This is because:

Records are stored in a sorted order and therefore accessed faster.
A hierarchical structure is used to minimize disk reads.
It can handle arbitrary number of insertions and deletions.

Disadvantages:

It is difficult to write B star trees.
It is better to not use B trees when a data file is relatively static and unchanging.

C++ Data structure in C++ - April 16, 2009 at 14:10 PM by Vidya Sagar

What are the advantages and disadvantages of B-star trees over Binary trees?

B-tree is an external data structure; where as binary tree is a structure that resides in main memory. The complexity of computations of binary tree is counted by the comparing each node, where as the complexity of computations of B-tree is counted by the number of nodes that are loaded from disk to memory by performing disk I/Os. The different values comparison in one node is ignored for counting.

Also read

Explain the difference between Stack and Queue

Stack is a Last in First out (LIFO) data structure whereas Queue is a First in First out (FIFO) data structure..............

What is Stack? Explain its uses.

Stack is a Last in First out (LIFO) data structure. It is a linear structure and one can insert and delete from one end only which is called the top. It is very effective in.............

Vector vs. deques

Deque is double ended queue. Deque elements can be accessed from both the ends while vector elements can be accessed using subscript notion.......................

What do you mean by stack unwinding?

When an exception is thrown, C++ calls destructors to destroy all the objects formed since the beginning of the try block. The objects are destroyed in the.............

What is NULL pointer and void pointer and what is their use?

A NULL pointer has a fixed reserved value that is not zero or space, which indicates that no object is referred. NULL pointers are used in C and C++ as compile-time constant. NULL pointer represents certain conditions, like successor to the last element in linked list, while a consistent structure of the list of nodes are maintained.......................

The answers to following questions will be made available soon. Keep visiting.

Explain Stacks and queues in detail.
Describe linked list using C++ with an example.
Describe Trees using C++ with an example.
Describe binary trees and its uses.
Explain implementation of traversal of a binary tree.
Explain implementation of deletion from a binary tree.