Binary Search

Question 1

Hints of BS:

Answer 1

Sorted and target makes it directly Binary Search

Question 2

What is the raw binary search algorithm?

Question 3

What is binary search called?

Answer 3

half-interval search

Question 4

What is binary search?

Answer 4

It is an algorithm used to find the position of a value in a sorted array.

Question 5

How does BS work?

Answer 5

the list is split in half and then searched in each half. The list must be sorted before running the algorithm.

Question 6

What loop is must in binary search?

Answer 6

While loop

Question 7

Binary search while loop format

Answer 7

while left<=right; return the formula

then make the if statements

Question 8

What is inorder traversal?

Answer 8

1. Traverse the left subtree
2. Visit the root.
3. Traverse the right subtree

Question 9

Does traversing by inorder traversal, and the elements being in the true order means the tree is actually in order?

Answer 9

IDK yet

Question 10

What happens if the binary search tree has duplicate elements?

Answer 10

It must be on the left side if it is allowed

Question 11

flip the logic of BST

Answer 11

Validate the left tree node’s value to make sure that it is less than the current root value(the roots change every node)

Question 12

BST recursive function with (min,max) range

Answer 12

initially, the range is infinite. At left side, the min is negative infinity and the max is root.value. The recursive function needs to be implemented and properly adjusted the ranges as traversed through the tree