This preview has intentionally blurred sections. Sign up to view the full version.
View Full 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 23 tree 3) Write pseudo code to make a copy of a 234 tree 4) Draw some trees based on the following numbers to be inserted: 50 70 90 75 74 100 71, 85 Create the 23, 234,Red Black, AVL trees … show your work!...
View
Full
Document
This note was uploaded on 10/16/2011 for the course CS 163 taught by Professor Fant during the Spring '09 term at Portland State.
 Spring '09
 Fant
 Binary Search, Data Structures

Click to edit the document details