| Current Forum: 15-211 Main Forum |
| Date: Wed Dec 19 2001 11:09 am |
| Author: Shi, Ying <shy@cmu.edu> |
| Subject: Re: Q, 4 Fall 99, heap, balanced tree |
|
|
1. I think for an AVL insertion can be done with O(log(N)) too
2. that's because of the particular heap order property. when you search down a node, you can NOT decide to go down left or right, so you basicly will have to touch each single node
right ? |
|