New Post Sign in

Home Explore Saved Profile

Home Explore Saved Profile

Community guidelines

About AI on OfCourse: AI answers are summaries of student posts and can be wrong or out of date. Check the linked posts and your official course materials, and follow your course's academic integrity rules.

Guidelines Terms© 2026 OfCourse

Jordan Kim · OfCourse

JK

Jordan Kim

Georgia Tech Verified(verified university email)

@jordankim

Computer Science · Georgia Tech · Class of 2027

“Trees, graphs and too much coffee. Happy to explain rotations to anyone.”

Joined August 2025

5Contributions

32Lumens

4Comments

2Courses

Featured contributions

Concept ExplanationWhy do AVL rotations actually work?Radiant · 19 litCS 1332

Posts1

19. Radiant · 19 lit, 0 off.

Concept ExplanationCS 1332

Why do AVL rotations actually work?

JKJordan Kim32 Lumens·Georgia Tech(verified university email)

Recent comments

on What's the most intuitive way to think about BST deletion?· CS 1332 · 4 weeks agoThe successor is the smallest value in the right subtree, so it's bigger than everything on the left and smaller than everything else on the right. That's why it can take the deleted node's spot.
on Picturing AVL rotations as a see-saw· CS 1332 · last monthAgreed. I pair it with drawing the four cases side by side.
on Why do AVL rotations actually work?· CS 1332 · 2 months agoGood call. Short version: after the rotation, the new subtree root always ends up with balance 0, and the other two depend on the grandchild's original balance. I'll write it up.
on Why do AVL rotations actually work?· CS 1332 · 2 months agoColored pens for the heavy side are genius. Might redo my notes that way.

Courses

CS 1332
Data Structures & Algorithms
Summer 2026 · 5 contributions
CS 2110
Computer Organization & Programming
Summer 2026 · 0 contributions

·Spring 2026

·

2 months ago

Rotations felt like magic until I realized they are just a way to re-pick the root of a small subtree while keeping BST order. Take the right-right case: A has right child B, and B has right child C. The subtree leans right. A single left rotation makes B the…

AVL Trees Trees