Abstract: Study of binary trees has prominent place in the training course of DSA (Data Structures and Algorithms). Their implementation in C++ however is traditionally difficult for students. To a large extent these difficulties are due not so much to the complexity of algorithms as to language complexity in terms of memory management by raw pointers – the programmer must consider too many details to ensure a reliable, efficient and secure implementation. Evolution of C++ regarded to automated resource management, as well as experience in implementation of linear lists by means of C++ 11/14 lead to an attempt to implement binary search trees (BST) via smart pointers as well. In the present paper, the authors share experience in this direction. Some conclusions about pedagogical aspects and effectiveness of the new classes, compared to traditional library containers and implementation with built-in pointers, are made.

Ivaylo Donchev and Emilia Todorova, “Implementation of Binary Search Trees Via Smart Pointers” International Journal of Advanced Computer Science and Applications(IJACSA), 6(3), 2015. http://dx.doi.org/10.14569/IJACSA.2015.060309

@article{Donchev2015,
title = {Implementation of Binary Search Trees Via Smart Pointers},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2015.060309},
url = {http://dx.doi.org/10.14569/IJACSA.2015.060309},
year = {2015},
publisher = {The Science and Information Organization},
volume = {6},
number = {3},
author = {Ivaylo Donchev and Emilia Todorova}
}