Description
-
Download the following file
Binary tree traversals
During lectures, we have discussed binary tree traversals. Your first task is to implement recursive methods to do preorder, inorder and postorder traversals. This should be a simple task, based on pseudocodes seen in lecture, and take only a few minutes to code and test. More specifically complete the following methods inside LikedBinarySearchTree class:
-
void preorderRecursive(Node)
-
void inorderRecursive(Node)
-
void postorderRecursive(Node)