I'm in a data structures course right now and we learned about 2-3-4 trees and splay trees. I was wondering in what circumstances would you use a 2-3-4 tree instead of a splay tree? They're both self balancing and sorted so I don't see that much of a difference between them.
Using a 2-3-4 tree instead of a splay tree
567 Views Asked by user479988 At
1
There are 1 best solutions below
Related Questions in DATA-STRUCTURES
- Deleting Orphans with Fluent NHibernate
- NHibernate ICompositeUserType split string columns
- NHibernate Second Level Cache for Collections is Slow
- NHibernate - using CreateMultiQuery
- NHibernate.Mapping Exception. No persister for Namespace.className
- Trouble combining Linq Expressions into a Func
- Join Tables using Fluent Nhibernate
- NHibernate - NonUniqueObjectException
- Restrictions.Disjunction().Add(Subqueries.WhereValue(1)
- Nhibernate: Exception occurred getter of id
Related Questions in SPLAY-TREE
- Deleting Orphans with Fluent NHibernate
- NHibernate ICompositeUserType split string columns
- NHibernate Second Level Cache for Collections is Slow
- NHibernate - using CreateMultiQuery
- NHibernate.Mapping Exception. No persister for Namespace.className
- Trouble combining Linq Expressions into a Func
- Join Tables using Fluent Nhibernate
- NHibernate - NonUniqueObjectException
- Restrictions.Disjunction().Add(Subqueries.WhereValue(1)
- Nhibernate: Exception occurred getter of id
Related Questions in 2-3-4-TREE
- Deleting Orphans with Fluent NHibernate
- NHibernate ICompositeUserType split string columns
- NHibernate Second Level Cache for Collections is Slow
- NHibernate - using CreateMultiQuery
- NHibernate.Mapping Exception. No persister for Namespace.className
- Trouble combining Linq Expressions into a Func
- Join Tables using Fluent Nhibernate
- NHibernate - NonUniqueObjectException
- Restrictions.Disjunction().Add(Subqueries.WhereValue(1)
- Nhibernate: Exception occurred getter of id
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
A 2-3-4 tree only changes the structure on insertions and deletions, while a splay-tree also re-organizes the nodes on searches.
Splay trees will, thanks to the re-organization on lookup, provide faster responses if your typical usage pattern happens to look up a small subset of elements most of the time.
It is possible to implement a 2-3-4 tree such that the smallest element can be looked up in O(1), but generally both offer insertion and deletion at amortized O(log n).