New installment in Scott Mitchell’s series on Data Structures


Part 3: Binary Trees and BSTs
This article, the third in a six-part series on data structures in the .NET Framework, looks at a common data structure that is not included in the .NET Framework Base Class Library: binary trees. Whereas arrays arrange data linearly, binary trees can be envisioned as storing data in two dimensions. A special kind of binary tree, called a binary search tree, or BST, allows for a much more optimized search time than with arrays.

Comments (3)

  1. I have been following the .NET Series on Data Structures.

    The article is very well written and his mathematical and technical explanations are very clear.

    I am looking forward to the rest of the series on data structures

  2. Scott Mitchell’s series on Data Structures has inspired me to blog on Naive Bayes Classifiers

Skip to main content