1 / 5

Discovering Optimal Strategies in Binary Search Trees and Coin Problems

This document delves into the principles of binary search trees and their applications in decision-making processes. It presents an engaging example of a counterfeit coin problem, where among eight coins, seven are identical in weight, and one is lighter. The exploration asks how many weighings are necessary to identify the counterfeit coin efficiently, highlighting optimal strategies for both binary searches and logical problem-solving.

burt
Télécharger la présentation

Discovering Optimal Strategies in Binary Search Trees and Coin Problems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 10.2 Applications

  2. Binary Search Tree • Example: • Marzano, Quinn, Lasher, Zimmer, Weening, Hillman, Nuhfer

  3. Binary Search • If data is sorted first, what happens?

  4. Binary search tree • Where is the optimal place to start?

  5. Counterfeit coin ex • Suppose you have 7 coins of the same weight and 1 lighter counterfeit coin. How many weighings are necessary to find the counterfeit?

More Related