lec0311-BST - Todays announcements: MP4 available, due...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
MP4 available, due 3/11, 11:59p. MP5 available tonight. Today: Binary Search Trees Today’s announcements:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Traversals: A few mechanical questions… What is the 2nd letter printed in an inOrder traversal of this tree? In what position is C printed in a postOrder traversal of this tree? Which traversal prints the data of the tree in ABC order? Draw and label a tree containing 8 integers so that an inOrder traversal of the tree prints the numbers in order. Draw and label a tree containing 8 integers so that a preOrder traversal of the tree prints the numbers in order. A B C E D
Background image of page 2
Traversals: A few discussion questions… template<class T> void binaryTree<T>::preOrder(treeNode * croot){ if (croot != null){ yell(croot->data); preOrder(croot->left); preOrder(croot->right); } } What is running time? Is preOrder public or private? How could we make this function employ a different function upon a visit?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Traversals: a broader view… template<class T> treeNode * binaryTree<T>::copy(treeNode * croot){
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 12

lec0311-BST - Todays announcements: MP4 available, due...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online