Talk:AVL tree/C++: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
The algorithms started out life in Pascal in a book called "Data Structures and Program Design" by Robert L Kruse. These were top/down (i.e. root to leaf) recursive algorithms without parent pointers. In 2006, the algorithms were made bottom/up (i.e. leaf to root) and the recursion was abolished (using parent pointers). These algorithms may be compared to the red/black set algorithms of STL. [[User:NNcNannara|NNcNannara]] ([[User talk:NNcNannara|talk]]) 12:30, 13 July 2016 (UTC) |
The algorithms started out life in Pascal in a book called "Data Structures and Program Design" by Robert L Kruse. These were top/down (i.e. root to leaf) recursive algorithms without parent pointers. In 2006, the algorithms were made bottom/up (i.e. leaf to root) and the recursion was abolished (using parent pointers). These algorithms may be compared to the red/black set algorithms of STL. [[User:NNcNannara|NNcNannara]] ([[User talk:NNcNannara|talk]]) 12:30, 13 July 2016 (UTC) |
||
I tested the elaborate code versus the shorter C++ version (on the main page |
I tested the elaborate code versus the shorter C++ version (on the main page) with the following results: |
||
<pre> |
<pre> |
||
AVLtree insertions took: 00:00:02.5097816 |
AVLtree insertions took: 00:00:02.5097816 |