Hw3 - d) make a complete copy of a binary search tree...

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

View Full Document Right Arrow Icon
Homework #3 CS 163 Data Structures Answer the following questions: Write C++ to determine the following for a binary search tree , implemented using a non-linear linked list: 1) Write functions to perform the following: a) display the smallest item in a binary search tree b) write the code to find the height of a binary search tree (which is the longest path) c) count each leaf in a binary search tree
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: d) make a complete copy of a binary search tree forming a new binary search tree 2) Write pseudo code that counts the number of nodes in a 2-3 tree 3) Write pseudo code to make a copy of a 2-3-4 tree 4) Draw some trees based on the following numbers to be inserted: 50 70 90 75 74 100 71, 85 Create the 2-3, 2-3-4,Red Black, AVL trees show your work!...
View Full Document

Page1 / 2

Hw3 - d) make a complete copy of a binary search tree...

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

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