it’s time to demonstrate your skills and perform a binary search

 It’s time to demonstrate your skills and perform a Binary Search Tree – Algorithm Visualization. For this assignment:

  • Complete the Steps outlined for Part 1 and Part 2. You will complete Participation Activities, found in the course zyBook, and use a tree simulator. Take screen captures as indicated in the steps for Part 1 and Part 2. Access the BST Tree Simulator for this assignment.
  • In a Microsoft® Word document, write a Reflection for Part 1 and Part 2. Include all required screen captures for Part 1 and Part 2 and responses to the prompts outlined in the Reflection sections. Label Part 1 and Part 2 of your reflection accordingly.
  • Submit your Reflection for Part 1 and Part 2 as a single Microsoft Word document.

Part 1

Validate zyBook Participation Activities 4.5.2, 4.5.3, and 4.5.4 in the tree simulator. Take screen captures of your trees as indicated in the steps below. You will have 6 images to submit for your Part 1 Reflection.

Complete the following steps:

  1. Click the Binary search tree visualization link. This will open in a separate window. Leave open.
  2. In the zyBooks course, return to 4.5.2: BST insert algorithm Participation Activity. If possible, place the two windows side-by-side for easier visualization.
  3. Enter the data you see in the 4.5.2 Participation Activity tree (20, 12, 23, 11, 21, 30) by inserting each node in the simulator. Reflect on what you see. Is it the same as the tree in zyBooks? If different, how?
  4. Validate 4.5.2 questions 1-4 again by using the simulator to check your answer. Screen capture and paste into a Microsoft Word document.
  5. Validate 4.5.3 questions 1-5 again, but this time use the simulator to check your answer. Screen capture each tree and paste it into a Microsoft Word document. You will have four trees for this section.
  6. Validate 4.5.4 questions 1-4 again, but this time use the simulator to check your answer. Screen capture each tree and paste it into Microsoft Word document.

Part 1 Reflection

In a Microsoft Word document, write your Part 1 Reflection. Include the required screen captures for the steps in Part 1 and your responses to the following:

  • Reflect on your experience using the BST simulator with this insert algorithm complexity in mind:
  • “The BST insert algorithm traverses the tree from the root to a leaf node to find the insertion location. One node is visited per level. A BST with N nodes has at least log2N levels and at most N levels. Therefore, the runtime complexity of insertion is best case O(logN) and worst case O(N).”
  • Reflect on how you observed this behavior in the simulator. You can reference a specific participation activity in your response. If you use research in your answer, be sure to cite your sources.

Part 2

Validate the 4.6.1, 4.6.2, and 4.6.3 Participation Activities in the tree simulator. Take screen captures of your trees as indicated in the steps below. You will have 6 images to submit for your Part II Reflection.

Complete the following steps:

  1. In the zyBooks course, return to 4.6.1: BST remove algorithm Participation Activity. If possible, place the two windows side-by-side for easier visualization.
  2. Enter the data you see in the 4.6.1 Participation Activity tree (19, 14, 25) by inserting each node in the simulator. Remove the leaf and reflect on what you see. Is it the same as the tree in the zyBooks simulation? If different, how?
  3. Answer 4.6.1 questions 1-4 again, but this time use the simulator to validate your answer. Screen capture and paste into a Microsoft Word document. Rather than answering the question in the participation activity again, use the simulator to answer and validate your answers.
  4. Answer 4.6.2 questions 1-5 again, but this time use the simulator to validate your answer. Screen capture each tree and paste into a Microsoft Word document. You will have four trees for this section.
  5. Answer 4.6.3 questions 1-4 again, but this time use the simulator to validate your answer. Screen capture and paste into a Microsoft Word document.

Part 2 Reflection

In a Microsoft Word document, write your Part 2 Reflection. Include the required screen captures for the steps in Part 2 and your responses to the following:

  • Reflect on your experience using the BST simulator with this remove algorithm complexity in mind:
  • “The BST remove algorithm traverses the tree from the root to find the node to remove. When the node being removed has 2 children, the node’s successor is found and are cursive call is made. One node is visited per level, and in the worst-case scenario, the tree is traversed twice from the root to a leaf. A BST with N nodes has at least log2N levels and at most N levels. Therefore, the runtime complexity of removal is best case O(logN) and worst case O(N). Two pointers are used to traverse the tree during removal. When the node being removed has 2 children, a third pointer and a copy of one node’s data are also used, and one recursive call is made. Thus, the space complexity of removal is always O(1).”
  • Reflect on how you observed this behavior in the simulator. You can reference a specific participation activity in your response. If you use research in your answer, be sure to cite your sources.
Premium Custom Essays
Calculate your paper price
Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

Professional and Experienced Academic Writers

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

24/7 Customer Support

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

Essays

Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.

Admissions

Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.

Reviews

Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.

Reviews

Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.