answersLogoWhite

0

1. direct access to the elements

2. the elements are sorted

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

How can you merge two binary search trees into a single binary search tree?

To merge two binary search trees into a single binary search tree, you can perform an in-order traversal on each tree to extract their elements, combine the elements into a single sorted list, and then construct a new binary search tree from the sorted list. This process ensures that the resulting tree maintains the binary search tree property.


What is the purpose of performing a binary search tree inorder traversal?

Performing a binary search tree inorder traversal helps to visit all nodes in the tree in ascending order, making it easier to search for specific values or perform operations like sorting and printing the elements in a sorted order.


What assumption about the list is made when binary search is conducted?

Binary search requires that the list be in search key order.


Items that are not suitable for a binary search?

The only items suitable for a binary search are those which are in a sorted order.


Is sorting a binary search tree simple?

A binary search tree is already ordered. An in order traversal will give you a sorted list of nodes.


What is complexity of binary search tree?

The complexity of binary search tree : Search , Insertion and Deletion is O(h) . and the Height can be of O(n) ( if the tree is a skew tree). For Balanced Binary Trees , the Order is O(log n).


It is pre requisite for binary search that the list should be in sorted order but if you have a unsorted list then which searching technique would be better binary search or linear search?

4 more info search how dangerous is the swine flu


The order of binary search algorithm is?

n log n - G.Parthiban, SRM


How many verification steps are required in order to perform a phone money transfer?

There are many steps that are required in order to perform a phone money transfer. There are exactly nine steps which are required to be able to do so.


What role does knowledge of data organization have in information retrieval?

Knowledge of how information is organized will allow a programmer to make more informed decisions on how to retrieve information. A simple example of this is the binary search. If you're looking for information in a list of data, you would normally need to perform an inefficient O(n) linear search. But if you happen to know that the data will always be in sorted order, you can use a nice O(log n) binary search instead.


Which of the following traversal is used for printing the keys of binary search tree in ascending order?

In order traversal is used.


Is HIV binary fission or conjugation?

The HIV is a virus and does not perform the bacterial reproduction of binary fission or conjugation in order to reproduce. The only way a virus reproduces is by infecting a host cell.