Binary Tree Traversals and Views.
-
Updated
Nov 10, 2019 - Java
Binary Tree Traversals and Views.
Here are two samples of the tree structure and an ability to set traversing type in-depth or in-width
This program represents the form of binary trees in linked lists, it allows in-order, pre-order and post-order traversals, as well as inserting new nodes, searching for keys, deleting nodes, among other functions.
Add a description, image, and links to the tree-traversal-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the tree-traversal-algorithms topic, visit your repo's landing page and select "manage topics."