Binary Search Tree Investigation
Welcome to my commentary about trees.
I will try to make this as insightful as possible, due to my interest in both the area of data structures in Mathematics and Computer Science.
The reason why we use trees in mathematics is for organizing data into a structured manner and to link each of the pieces of data (from now on referred to as Objects), together.
The advantage of using a tree structure is due to it’s ability of holding continuous real-world data, which can be added and deleted at any time.
In other words, strictly for scientific purposes, trees are ideal manners of organizing data in a sequential, structured manner, and at the same time allowing for the structure to grow and shrink in real-time.
There are four required steps/procedures to be taken before the “tree” can work as an efficient representation of a certain data structure:
Step One: data must be “sorted” in a certain manner.
This means, that the data may be sorted in degree of polynomials, by the number of their significant figures (floating point calculations), in order of ascending or descending numerical value (from lowest to highest or reverse order), and other.
In computer science, a strict algorithm is used as a means of maintaining the efficiency of the data structure (i.e. if it contains continuous data or any form of decimal number set where “precision matters” we want the precision of the numbers to be kept as they are once they are sorted.
Therefore, the binary search is implemented.
Function of the binary search:
1)
Considering that the structure is already sorted (if not we need to do so)the goal of the binary search is to find a location within the “tree” called the key, and ensure, that there is space for it if something were to be overwritten on it.
The binary search functions by looking through the whole length of the data structure (it finds the range between the maximum and minimum, as well as the average between the highest and lowest values and
I will try to make this as insightful as possible, due to my interest in both the area of data structures in Mathematics and Computer Science.
The reason why we use trees in mathematics is for organizing data into a structured manner and to link each of the pieces of data (from now on referred to as Objects), together.
The advantage of using a tree structure is due to it’s ability of holding continuous real-world data, which can be added and deleted at any time.
In other words, strictly for scientific purposes, trees are ideal manners of organizing data in a sequential, structured manner, and at the same time allowing for the structure to grow and shrink in real-time.
There are four required steps/procedures to be taken before the “tree” can work as an efficient representation of a certain data structure:
Step One: data must be “sorted” in a certain manner.
This means, that the data may be sorted in degree of polynomials, by the number of their significant figures (floating point calculations), in order of ascending or descending numerical value (from lowest to highest or reverse order), and other.
In computer science, a strict algorithm is used as a means of maintaining the efficiency of the data structure (i.e. if it contains continuous data or any form of decimal number set where “precision matters” we want the precision of the numbers to be kept as they are once they are sorted.
Therefore, the binary search is implemented.
Function of the binary search:
1)
Considering that the structure is already sorted (if not we need to do so)the goal of the binary search is to find a location within the “tree” called the key, and ensure, that there is space for it if something were to be overwritten on it.
The binary search functions by looking through the whole length of the data structure (it finds the range between the maximum and minimum, as well as the average between the highest and lowest values and