Binary Search Tree ADT
Source Code:
Github: BinarySearchTree.java
Output:
Insert 50 : 42 Insert 40 : 42 / 40 Insert 32, 45, 65, 55, 66, 7, 42,87 : 42 / \ / \ / \ / \ / \ / \ / \ / \ 40 45 / \ / \ / \ / \ 32 65 / / \ / / \ 7 55 66 \ 87 Min : Node(7) Max : Node(87) Find 55 :Node(55) Find 87 :Node(87) Find 76 :null Delete 87: 42 / \ / \ / \ / \ 40 45 / \ / \ 32 65 / / \ 7 55 66 Delete 32: 42 / \ / \ / \ / \ 40 45 / \ / \ 7 65 / \ 55 66 Delete 40: 42 / \ / \ / \ / \ 7 45 \ \ 65 / \ 55 66 Delete 65: 42 / \ / \ / \ / \ 7 45 \ \ 55 \ 66 Delete 50: 42 / \ / \ / \ / \ 7 45 \ \ 55 \ 66 Delete 45, 7, 55, 42, 66 : 42