How to cite AVL tree
Binary trees
An AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree.
More informations about AVL tree can be found at this link.
http://citebay.com/how-to-cite/avl-tree/
Copy to clipboard: CTLR + C, then ENTER or click OK
Content
Citation in APA style
Citation in Vancouver style
Citation in Harvard style
Citation in Bibtex format
@techreport{adelsonvelskii1963algorithm,
title={An algorithm for the organization of information},
author={AdelsonVelskii, M and Landis, Evgenii Mikhailovich},
year={1963},
institution={JOINT PUBLICATIONS RESEARCH SERVICE WASHINGTON DC}
}
title={An algorithm for the organization of information},
author={AdelsonVelskii, M and Landis, Evgenii Mikhailovich},
year={1963},
institution={JOINT PUBLICATIONS RESEARCH SERVICE WASHINGTON DC}
}
@techreport{adelsonvelskii1963algorithm,
title={An algorithm for the organization of information},
author={AdelsonVelskii, M and Landis, Evgenii Mikhailovich},
year={1963},
institution={JOINT PUBLICATIONS RESEARCH SERVICE WASHINGTON DC}
}
title={An algorithm for the organization of information},
author={AdelsonVelskii, M and Landis, Evgenii Mikhailovich},
year={1963},
institution={JOINT PUBLICATIONS RESEARCH SERVICE WASHINGTON DC}
}
Copy to clipboard: CTLR + C, then ENTER or click OK
Do you like it?
Unprofitable
Please consider a donation – we do it in our free time. Do it easily Support.
Join us
Suggestions are always welcome! You can also help us with writing and became a part of the team.
Share science!
Just tell your friends about us.
