answersLogoWhite

0

There are many types of trees:

- binary trees

- binary search trees

- B+ trees

- red-black trees

- AVL trees

- suffix trees

- and much more....

Each have different rules for adding a new element, removing an element, and searching for an element in the tree. Consequently, they all have different advantages and disadvantages.

User Avatar

Wiki User

13y ago

What else can I help you with?

Related Questions

What is an associative array?

An associative array is one of a number of array-like data structures where the indices are not limited to integers.


What do an array and a stack have in common?

Both are linear data structures.


What is the difference between an array of structures and an array within a structure?

The main differences between an array and a structure are: An Array is a collection of similar data items.An array is derived data type.It behave like a built in data type. An array can be increased or decreased. A structure is a collection of dissimilar data items.It is a user defined data types.It must be declared and defined.A structure element can be added if necessary.


Explain the Different types of array?

one dementional array and two dementional array


What types of index data structures can you have?

There are three types of index data structures: unique, non-unique, bitmap


What is the difference between an array and structure?

An array is a collection of related data elements of same type.Structure can have elements of different types.An array is a derived data type.A structure is a programmer-defined data type.A struct can contain multiple data types, whereas an array can not.


Should element in an array must be of primitive data type?

No, it can be array, structure or union as well.


How do you get the mean median and mode in c programming?

By writing in C code the mathematical methods for finding the mean, median and mode of your data taking into account how your data is stored (eg an array; two separate arrays one with data and the other with frequencies; a two dimensional array containing both data and frequencies; an array of structures containing the data instead of arrays; a linked list of structures; etc).


What are the differences between Homogeneous and non homogeneous data structures?

in homogeneous data structure all the elements of same data types known as homogeneous data structure. example:- array while there can b any type of data in non homogeneous data structure. example:- list


When an array contains values other than primitive data types is it considered a control array?

Only if the non-primitive data types are actually controls, such as an array of label controls, or an array of edit boxes. However, a control array is still an array. The only difference is that the values will likely be resource handles (objects that refer or point to the actual object which will be stored elsewhere in memory) rather than an actual value itself. That is, an array of primitive data types stores the actual value in the array itself.


What is a subarray and how is it defined in the context of data structures and algorithms?

A subarray is a contiguous sequence of elements within an array. In the context of data structures and algorithms, a subarray is defined as a subset of elements from an array that maintains the order of the original elements. It is commonly used in algorithms to analyze and manipulate specific parts of an array efficiently.


What are the permissible data types for an array index?

Integer (signed or unsigned)