A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
2006
In this paper, we consider a transformation on binary trees using new types of rotations. Each of the newly proposed rotations is permitted only at nodes on the left-arm or the fight-arm of a tree....
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI