Binary Tree algorithms implemented in java

Implements prefix, postfix, inorder, and levelorder notation and searches on a BST

Postfix to Infix converter built on binary Expression Tree. To convert the tree to Infix expression the inorder tree traversal is applied. Implemented in Java with GUI

Implementation of data structures

traversing trees by rucursive and non-recursive method. in-order, pre-order, post-order and level traversal.

In this repository you can find all of my assignments for Data Structures and Algorithms Course when I was in 3rd semester of my bachelor's at IAUSTB.

Words List Program using Binary Search Tree and outputs alphabetically using Inorder Traversal.

Data Structures and Algorithms - Implementation, Tests and Notes

Contains the implementation for an AVLTree with a generic type as the key.

Program written in java that reads in a text file and recursively creates and searches a BST

Implementing the iterator pattern in Java

In the class Algorithms and Datastructures, I have created methods used to add, remove and search through the nodes in a BST with different procedures.

Strategy design pattern