answersLogoWhite

0

map and set objects in many language where data is constantly entering and leaving

User Avatar

Wiki User

13y ago

What else can I help you with?

Related Questions

How do you print all data in a Binary Search Tree?

By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.


What are the application of binary tree in computer science?

What are the applications of Binary Tree.


Which is faster binary tree or binary search tree?

A tree doesn't do anything so it has no speed...


Does binary tree and binary search tree same?

no they are not same


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 binary search in data structure using c?

a tree which has atmost two nodes is called binary tree binary search tree is a binary tree which satisfies the following 1.every node in tree must be distinct 2.values in right subtree > value at root 3.values in left subtree < value at root 4.left,right subtrees must be binary search trees


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).


What is the different between a binary search tree and a binary tree?

self depend friend"s............


Is an AVL tree a binary search tree (BST)?

Yes, an AVL tree is a type of binary search tree (BST) that is balanced to ensure efficient searching and insertion operations.


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 the time complexity of searching a binary search tree?

The time complexity of searching a binary search tree is O(log n), where n is the number of nodes in the tree.


What is the use of binary?

Binary trees are commonly used to implement binary search tree and binary heaps.