What is splay trees?
Submitted by: AdministratorA splay tree is a self-balancing binary search tree. In this, recently accessed elements are quick to access again
It is useful for implementing caches and garbage collection algorithms.
When we move left going down this path, its called a zig and when we move right, its a zag.
Following are the splaying steps. There are six different splaying steps.
1. Zig Rotation (Right Rotation)
2. Zag Rotation (Left Rotation)
3. Zig-Zag (Zig followed by Zag)
4. Zag-Zig (Zag followed by Zig)
5. Zig-Zig
6. Zag-Zag
Submitted by: Administrator
It is useful for implementing caches and garbage collection algorithms.
When we move left going down this path, its called a zig and when we move right, its a zag.
Following are the splaying steps. There are six different splaying steps.
1. Zig Rotation (Right Rotation)
2. Zag Rotation (Left Rotation)
3. Zig-Zag (Zig followed by Zag)
4. Zag-Zig (Zag followed by Zig)
5. Zig-Zig
6. Zag-Zag
Submitted by: Administrator
Read Online Data Structures Trees Job Interview Questions And Answers
Top Data Structures Trees Questions
| ☺ | Explain red-black trees? |
| ☺ | How to find the depth of a binary tree? |
| ☺ | What is threaded binary tree. Explain its common uses? |
| ☺ | Do you know implementation of traversal of a binary tree? |
| ☺ | Explain B+ tree? Explain its uses? |
Top Coding/Programming Categories
| ☺ | Python Interview Questions. |
| ☺ | OOP Interview Questions. |
| ☺ | Software engineering Interview Questions. |
| ☺ | PHP Interview Questions. |
| ☺ | VBA (Visual Basic for Applications) Interview Questions. |
