TheManysh / CE2020_Lab4_63_64

COMP202 Lab Exercise with 64. Regal Adhikari

Binary Search Tree Implementation using array and linkedlist

LinkedList Implementation (By Manish Shivabhakti (63))

• isEmpty (check if BST is empty)
• addBST (add data to BST)
• removeBST (remove data from BST)
• searchBST (check if the key exists in BST)

Array Implementation (By Regal Adhikari (64))

• isEmpty (check if BST is empty)
• addBST (add data to BST)
• removeBST (remove data from BST)
• searchBST (check if the key exists in BST)