Lesson 5: More of BST

In this post I will be discussing briefly about the logic in searching a certain node, adding new nodes to a tree, delete a node that are already present within a tree and some computer reading processes (prefix, postfix and infix).