Rotation distance
id:
rotation-distance-312-2215482
title:
Rotation distance
text:
In discrete mathematics and theoretical computer science, the rotation distance between two binary trees with the same number of nodes is the minimum number of tree rotations needed to reconfigure one tree into another. Because of a combinatorial equivalence between binary trees and triangulations of convex polygons, rotation distance is equivalent to the flip distance for triangulations of convex polygons. Rotation distance was first defined by Karel Čulík II and Derick Wood in 1982. Every two
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Rotation_distance
date created:
date modified:
2024-01-05T16:51:33Z
main entity:
{"identifier":"Q85797976","url":"https://www.wikidata.org/entity/Q85797976"}
image:
fields total:
13
integrity:
13