Synopsis

Binary search tree implementation in Java 8

Code Example

Initialize an undirected graph and add edges.

BinarySearchTree b = new BinarySearchTree();
b.insert(3);
Node x = b.insert(8);
b.insert(1);
b.insert(4);
b.insert(6);
b.insert(2);
b.insert(10);
b.insert(9);

(or)

bst.insertWithArray(7, 5, 3, 6, 1, 4, 12, 9, 15, 8, 10, 13, 17);

Implementation

• Depth First Traversal
• Breadth First Traversal
• Height of Node
• Height of Tree
• Is Tree balanced
• Is Isomorphic?
• Find if data is present in tree
• Are two Binary trees equal
• Are two Binary trees Isomorphic?

Installation

Clone

API Reference

Depending on the size of the project, if it is small and simple enough the reference docs can be added to the README. For medium size to larger projects it is important to at least provide a link to where the API reference docs live.

Tests

Test cases cover the following

• Is Isomorphic?

    mvn test

Reference

• Binary Tree & Binary Search Tree

Contributors

Anyone can contribute to this project.

TODO

• Implement all test cases

License

MIT