For the set of numbers {14, 7, 12, 20, 2, 18, 17, 10, 3, 5, 16, 19, 8} 1. Draw a Binary Search Tree diagram for the set of numbers. a) Send me a diagram of what the binary tree looks like. If you don’t have a way of drawing it using your PC, draw it on a piece of paper and take a picture of it. b) Fill in the array structures leftPtr & rightPtr (see below), based on the diagram of your binary tree. leftPtr and rightPtr store the address of the child node to the left and right. In my example, I used 12 as my root. You can use or another number from the set if you want. I did a couple as an example, you do the rest.
For the set of numbers {14, 7, 12, 20, 2, 18, 17, 10, 3, 5, 16, 19, 8}
1. Draw a Binary Search Tree diagram for the set of numbers.
a) Send me a diagram of what the binary tree looks like. If you don’t have a way of
drawing it using your PC, draw it on a piece of paper and take a picture of it.
b) Fill in the array structures leftPtr & rightPtr (see below), based on the diagram of your
binary tree. leftPtr and rightPtr store the address of the child node to the left and right.
In my example, I used 12 as my root. You can use or another number from the set if
you want. I did a couple as an example, you do the rest.
2. Generate pseudocode for a function that will find the minimum value in the tree, in the most
efficient manner (i.e. not linear search)
3. Generate pseudocode for a function that will find the maximum value in the tree, in the most
efficient manner (i.e. not linear search)
Send to me in a MS Word document if possible. There are (4) deliverables (1a, 1b, 2 & 3)
![Send to me in a MS Word document if possible. There are (4) deliverables (1a, 1b, 2 & 3).
Array Structures: 3 arrays (value, leftPtr, rightPtr)
root = 2
address value
leftPtr rightPtr
14
1
7
12
3
20
4
2.
18
17
7
10
8.
4
null
10
16
11
19
12
8.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc43e03e1-b353-4d50-a726-bab1a8232fef%2F8cd84a18-4202-45a6-a4a2-b239f436bec3%2F26jzkco_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)