263 }
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x80518e8,
    results=...) at avltree.h:261
261     traversal_preorder(root->m_right, results);
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x0, results=...)
    at avltree.h:257
257     if(!root)
(gdb)
258         return true;
(gdb)
263 }
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x80518e8,
    results=...) at avltree.h:262
262     return true;
(gdb)
263 }
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x80514a0,
    results=...) at avltree.h:262
262     return true;
(gdb)
263 }
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x8051560,
    results=...) at avltree.h:262
262     return true;
(gdb)
263 }
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x80513a0,
    results=...) at avltree.h:262
262     return true;
(gdb)
263 }
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x80513b8,
    results=...) at avltree.h:262
262     return true;
(gdb)
263 }
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x8051320,
    results=...) at avltree.h:262
262     return true;
(gdb)
263 }
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x8051548,
    results=...) at avltree.h:261
261     traversal_preorder(root->m_right, results);
(gdb)
Avltree<int>::traversal_preorder (this=0xbffff9d0, root=0x80514b8,
    results=...) at avltree.h:257
257     if(!root)
(gdb)
259     results.push_back(root->m_obj);