Comparing Leaf and Root Insertion
We consider two ways of inserting a key into a binary search tree: leaf insertion which is the standard method, and root insertion which involves additional rotations. Although the respective cost of constructing leaf and root insertion binary search trees trees, in terms of comparisons, are the s...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
South African Institute of Computer Scientists and Information Technologists
2010-07-01
|
| Series: | South African Computer Journal |
| Subjects: | |
| Online Access: | http://sacj.cs.uct.ac.za/index.php/sacj/article/view/21 |