codeIIEST/Algorithms

Competitive Coding/Tree/Binary Tree/preorder_traversal/readme.md

Summary

Maintainability

Test Coverage

Issues

# Preorder Traversal

![alt text](https://javabeat.net/wp-content/uploads/2013/11/BST_Preorder.jpg)

Algorithm Preorder(tree)
   * Visit the root.
   * Traverse the left subtree, i.e., call Preorder(left-subtree)
   * Traverse the right subtree, i.e., call Preorder(right-subtree)