Question

use the following binary search tree to answer the questions. a. how many comparisons are needed to search for ""2"" in this tree? b. you need to add 7 to the tree. where will it go?

Answer 1

A data structure called a binary search tree makes it simple to keep track of a sorted list of numbers.

What is a binary search tree?

A binary search tree, also known as an ordered binary tree or a sorted binary tree in computer science, is a rooted binary tree data structure where each internal node's key is higher than all the keys in its left subtree and less than all the keys in its right subtree.

A data structure called a binary search tree makes it simple to keep track of a sorted list of numbers. Because each tree node has a maximum of two offspring, it is known as a binary tree. It can be used to search for the presence of a number in O(log(n)) time.

A binary search tree (BST) is a specific type of binary tree in which every node has a comparable key and a connected or associated value.

To learn more about binary search trees refer to:

brainly.com/question/28295292

#SPJ4