Before you keep reading...
Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.
Before you keep reading...
Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.
6.21. Key Terms
AVL tree |
height |
postorder traversal |
balance factor |
inorder traversal |
preorder traversal |
binary heap |
leaf node |
priority queue |
binary search tree |
level |
root |
binary tree |
map |
rotation |
BST property |
min/max heap |
sibling |
child / children |
node |
subtree |
complete binary tree |
parent |
successor |
edge |
parse tree |
tree |
heap order property |
path |
tree traversal |
You have attempted
of
activities on this page
