This preview shows pages 1–2. Sign up to view the full content.
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 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