https://docs.google.com/presentation/d/1vxa_CB7BRyGX4JrDsaQ3P0-myX74-Wepn2LlyRKf-VQ/edit?usp=sharing
Instructions and exercises for trees and heaps
-
Create a class representing a BST node.
-
Create manually an BST with the same structure as the one in the next image
-
Create a static method, which recevies a Node T and prints all its elements in-order.
-
Create a unit test to verify the traversal of the tree against the next string: "9-12-14-17-19-23-50-54-67-72-76"
