Binary Search Tree Algorithm Sequence
Harris Calvin
I know this has to do with the searching algorithm but looking at the sequence of numbers I still can't figure anything out.
Any ideas?
Michael Goldshteyn
One way to think about this is that the numbers both lower and higher than the number you are searching for should be getting closer to the number being searched for (from each respective side). What this means is that you should not be trying a number that is more distant than a number already tried (on a respective side).
For example, if you are searching for 500, and you've tried 250, then 750, you cannot try for example 230 or 780, because they are more distant from 500 on their respective sides than the numbers you've already tried (i.e., 250 and 750).
So, without giving away the answer, since this is clearly a homework question, you now have enough information to answer your own question.
Collected from the Internet
Please contact [email protected] to delete if infringement.
edited at
- Prev: How can "define" not be defined when loading with RequireJS?
- Next: Method returning null pointer error
Related
Related Related
- 1
Binary Search Tree Sequence
- 2
Binary Search Tree? Algorithm
- 3
Is there a unique Binary Search Tree for given sequence of numbers?
- 4
How to call upon a Binary Search Tree in an algorithm
- 5
Golang Binary Search Tree Algorithm Translation
- 6
How recursion works for this binary search tree algorithm
- 7
Binary Tree, Binary Search Tree, Binary search
- 8
Loopless function algorithm for binary search tree in-order traversal
- 9
Javascript: algorithm to convert Binary search tree to doubly linked list
- 10
Randomized binary search algorithm
- 11
Binary Search algorithm implementations
- 12
Binary search the answer algorithm
- 13
Binary search Algorithm - Python
- 14
Binary Search algorithm implementations
- 15
Binary Search Algorithm is not working
- 16
Destructor for Binary Search Tree
- 17
Binary Search Tree C
- 18
Binary Search tree - insertion
- 19
Merging Binary search tree
- 20
BINARY SEARCH TREE creation
- 21
Binary Search Tree - Sorted?
- 22
Insertion into Binary Search Tree
- 23
Validate Binary Search Tree
- 24
Split a binary search Tree
- 25
Interval search in Binary Tree
- 26
Is this an optimal binary search tree?
- 27
Layout a binary search tree
- 28
Binary Search Tree - Insert
- 29
Binary Search Tree Haskell
Comments