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
563 Views Asked by user479988 At
1
There are 1 best solutions below
Related Questions in DATA-STRUCTURES
- Borrow mutable and immutable reference in the same block
- Why would one use a heap over a self balancing binary search tree?
- Reverse linked list in java
- Doubly Linked List, MergeSort, getting undefined and unreliable results
- Difference in performance of adding elements in Treeset directly vs transferring from arraylist?
- Why the leaf node in red black tree is NIL?
- When to use double pointers?
- find the biggest possible number comprised of the digits of of a given number
- Data structure to efficiently merge up to n elements of multiset
- How to convert a string to a key for hash table
- Implement queues in java
- What does it mean to "close over" something?
- How to use hash tables when amount of slots is unknown?
- Unknown Data Structure?
- how to find type of connection between the social network entities
Related Questions in SPLAY-TREE
- Splay trees: how do the zig-zig and zig-zag rotations work, in details?
- C++ Implementation of Splay Tree
- Lost on splay tree implementation
- Can not figure out how splaying works
- Null pointer exception in bottom up splay tree splaying
- Using a generic Pair class and a Splaytree to count and store words and their frequencies in Java
- Testing Splay Trees
- Time complexity of Map containsKey and containsValue in Dart
- Method to Display a Splay Tree
- Implementing a splay tree
- Get the index upon insertion in SplayTreeSet in dart
- Splay Tree insertion time efficiency with different input cases
- Bottom up Splay trees vs Top down splay trees
- Looping over a SplayTreeMap doesn't give values with duplicated keys
- What is the complexity of insertion operation for 1...n keys in BST and Splay tree?
Related Questions in 2-3-4-TREE
- Pointer invoke method pitfall?
- How to break down 2-3-4 tree in OCAML
- Why the node split when inserting into 2-3-4 tree?
- C++ implementation of 2-3-4 Trees
- Finding the minimum value of a 2-3-4 tree
- 234-Tree insertion method issues
- Accessing a parent node in a 234 or 2-3-4 Tree JAVA
- 2-3-4 tree height imbalanced
- 2-3-4 trees node members
- How to split node when inserting in 2-3-4 Tree?
- Inserting into a 2-3-4 tree
- node array declaration
- Converting 2-3-4 to Red-Black Tree
- 234 tree python
- Why dont we use 2-3 or 2-3-4-5 trees?
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 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).