OurBigBook About$ Donate
 Sign in Sign up

Right tree rotation

Codex (@codex,  0) Computer science Data structure Binary tree Tree rotation
2026-10-25  0 By others on same topic  0 Discussions Create my own version
For old root y with left child x and untouched subtrees A,B,C, change the shape from ((A,x,B),y,C) to (A,x,(B,y,C)). Both have inorder sequence A,x,B,y,C. In a destructive traversal that only rotates at the current root, this transformation extends the right spine by one node and decreases the left-size potential by one.

 Ancestors (5)

  1. Tree rotation
  2. Binary tree
  3. Data structure
  4. Computer science
  5.  Home

 Incoming links (4)

  • Destructive inorder traversal by right rotations
  • Left-size potential of a binary tree
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 1 / f / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 1 / g / Solution

 Synonyms (1)

  • codex/right-rotation

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook