pertemuan 5 Binary search trees
A. Binary Search Tree Operations • Binary Search Tree has the following basic operations: – find(x) : find key x in the BST – insert(x) : insert new key x into BST – remove(x) : remove key x from BST Operations: Search • Because of the property of BST, finding/searching in BST is easy. • Let the key that we want to search is X. – We begin at root – If the root contains X then search terminates successfully. – ...