AVL trees
[108 byte] By [g_p_javaa] at [2007-10-2 9:42:37] 
Hi guys,an unbalanced AVL tree is a simple binary search tree?Thanks,in advance!
AVL trees are always balanced because they guarantee O(logn) retrieval.A balanced binary search tree will also be O(logn) retrieval. Thus, you could state that as long as a binary search tree is balanced it will have the same performance as an AVL tree.
rkippena at 2007-7-16 23:48:21 >
Other Topics New Topic
Other Topics Hot Topic
Other Topics
All Classified
- Archived Forums
- Enterprise & Remote Computing
- Java Essentials
- Desktop
- Core
- Solaris Operating System
- Security
- Database Connectivity
- Java Mobility Forums
- Web & Directory Servers
- Development Tools
- Application & Integration Servers
- Java HotSpot Virtual Machine
- Other Topics
- E-Mail, Calendar, & Collaboration
- Developer Tools
- General
- Administration Tools
- Sun Hardware
- Storage Forums
- Java Enterprise System
- StarOffice
- Open Source Technologies
- BigAdmin
- Real-Time
- Java Coding