Question

When the shape of a bst approaches that of a perfectly balanced binary tree, what is the worst case performance characteristic of searches and insertions?

Answer 1

The shape of a bst approaches that of a perfectly balanced binary tree, (log2n) is the time complexity for a balanced binary search tree in case of insertions and search.

In computing, binary bushes are mainly used for looking and sorting as they offer a way to save statistics hierarchically. a few common operations that may be conducted on binary trees encompass insertion, deletion, and traversal.

A binary tree has a special situation that each node could have a most of two youngsters. A binary tree has the benefits of each an ordered array and a linked listing as search is as brief as in a taken care of array and insertion or deletion operation are as fast as in related listing.

In pc science, a binary tree is a tree information shape in which every node has at maximum two youngsters, that are known as the left baby and the proper toddler.

Learn  more about binary trees here brainly.com/question/16644287

#SPJ4