Could someone please help me with these problems? theyre really giving me a hard

Question

Could someone please help me with these problems? theyre really giving me a hard time :(

Thanks ahead of time for any help!

Question 24 (1 point) Given the following array: 0 1 2 Position: Value 13 17 21 32 36 40 49 1 49 What is the POSITION of the first element encountered in a binary search for the value 19? Save Question 25 (1 point) Given the following array: 0 1 2 Position: Value 13 17 21 32 36 40 49 1 49 What is the POSITION of the second element encountered in a binary search for the value 19? Save Question 26 (1 point) Given the following array: Position: Value 13 17 21 32 36 40 49 1 49 What is the POSITION of the third element encountered in a binary search for the value 19?

Explanation / Answer

24. So if want to add 19 in that array then the position of 19 is 5.So the first element position is 4.

25.The position of second element is 9

26.The position of third element id 13.

In this binary tree take value 1 is the root element.

Binary Search Tree, is a node-based binary tree data structure which has the following properties:

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.