# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

83 Pages

### 05-BalancedTrees

Course: TCSS 342, Fall 2009
School: Washington
Rating:

Word Count: 1947

#### Document Preview

342, TCSS Winter 2006 Lecture Notes Balanced Binary Search Trees 1 TCSS 342B v1.0 Learn about balanced binary search trees AVL trees red-black trees Objectives Talk about why they work Talk about their run-time performance. 2 TCSS 342B v1.0 AVL Trees In 1960 two Russian mathematicians Georgii Maksimovich Adel'son-Vel'skii Evgenii Mikhailovich Landis developed a technique for keeping a binary search...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Washington >> Washington >> TCSS 342

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Washington - TCSS - 342
In class drill The following 20 numbers are inserted into an binary search tree. 297 789 597 408 723 344 695 91 289 981 27 360 65 436 700 920 99 925 6151. Build this BST.2. Insert into the BST the following numbers:256006056103. Delete
Washington - TCSS - 342
In class drill: 1. Show how mergesort would sort the following numbers: 297 597 723 695 289 27 65 700 99 6152. Do the same for quicksort.3. Also try insertion sort and selection sort on the same list of numbers.
Washington - TCSS - 342
TCSS 342, Winter 2006 Lecture NotesJava's Set ADT Java's Map ADT Sample Word Finding/Counting applicationversion 1.0 1ObjectivesLearn more about Java's Collection API Learn how Set and Map are used Discuss the basics of how they are im
Washington - TCSS - 342
Hashing practice sheet. Using the standard java hash function, the hash code for a String object is computed ass[0]*31^(n-1) + s[1]*31^(n-2) + . + s[n-1]using int arithmetic, where s[i] is the ith character of the string, n is the length of the st
Washington - TCSS - 342
In class self study.Heaps: Insert the following integers into a priority queue implemented as a heap, using top down insertion. Count how many comparisons and swaps you needed to execute. Draw both the complete binary tree and the corresponding arr
Washington - TCSS - 342
A Red-Black Tree15 3 2 5 10 11 20 25 2630 50 40 55 59 60 65 6670 85 80 81 90 91 115 7102-3-4 Trees and Red-Black Trees. Converting a Red-Black tree to a 2-3-4 tree and vice-versa.Unchanged5 22 4555 7 47646949The 2-3-4 tr
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Mathematical Principles of Computing I Winter 2006 Instructor: Ed Hong edhong@u.washington.edu Pinkerton 310 (253) 692-4659 Office hours: Tuesday 11AM-12Noon, Wednesday 2PM-4PM, or by appointment (use e-mail
Washington - TCSS - 342
import java.util.*;import java.io.*;class UseScanner { / This method reads a text file and prints its contents to the screen / it illustrates using the scanner class. / the name of the text file is taken from the input arguments
Washington - TCSS - 342
Reading file Hw1testinput1.txtE 13.32%N 12.1%T 9.49%I 9.19%S 7.96%A 7.35%L 5.82%R 5.67%O 4.13%M 3.52%F 3.37%C 3.22%U 2.6%G 2.14%P 1.99%H 1.84%D 1.68%W 1.07%Y 1.07%X 0.92%V 0.61%B 0.46%J 0.31%K 0.15%Q 0.0%Z 0.0%
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Winter 2006, Section B (Hong) Assignment #7 version 1.1 Due: Thursday, March 9, 2006, 4:15 PM Please show your work and explain your reasoning. Write legibly (or type) and organize your answers. Turn in your
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Winter 2006, Section B Written Assignment 1, Answers 1. Using the definition of logarithm in class, show that logA B = logC B / logC A . Let X = logA B Let Y = logC B Let Z = logC A. To show this, we will sh
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Winter 2006, Section B (Hong) Assignment #7 solution version 1.0 Due: Thursday, March 9, 2006, 4:15 PM Please show your work and explain your reasoning. Write legibly (or type) and organize your answers. Tur
Washington - TCSS - 342
Name:_ University of Washington, Tacoma TCSS 342B (Ed Hong), Mathematical Principles of Computing I MIDTERM. 2/7/06. solutions. Version 1.0 1. True, False, True, False. 2. front temp2 10 3 5353. O(n log n). Outer loop executes n times, inner l
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Mathematical Principles of Computing I September 29, 2004. If you need to review mathematics, you may read the following book: Discrete Mathematics and its Applications, by Kenneth H. Rosen. Chapter 1 includ
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Autumn 2004, Section A Handout 02: Practice Math and Java Problems September 29, 2004 If you need to review mathematics, you may read the following book: Discrete Mathematics and its Applications, by Kenneth
Washington - TCSS - 342
TCSS 342 In-class exercise (10/04/04) (revised 10/5) Exercise 1: What is the running time (expressed in Big-Oh notation) of the following code fragment? sum = 0; for (i = 0; i &lt; n; i+) { for (j = 0; j &lt; n * n; j+) { sum+; } }Exercise 2: What is the
Washington - TCSS - 342
Estimating Algorithm Performance How to determine how much time an algorithm A uses to solve problem X? Depends on input; use input length as parameter. Determine function f(n) representing cost. Code it and use timer running on many inputs Anal
Washington - TCSS - 342
TCSS 342 In-class exercise (10/04/04) (revised 10/5) SOLUTIONS. Exercise 1: What is the running time (expressed in Big-Oh notation) of the following code fragment? sum = 0; for (i = 0; i &lt; n; i+) { for (j = 0; j &lt; n * n; j+) { sum+; } }Clearly the l
Washington - TCSS - 342
BST addElement To addElement(), we essentially do a find( ). When we reach a null pointer, we create a new node there.void addElement(Object el, BinaryTreeNode t) { if (t = null) t = new BinaryTreeNode(el, null, null); else if (el &lt; t.element) addE
Washington - TCSS - 342
In class drill The following 20 numbers are inserted into an binary search tree. 297 789 597 408 723 344 695 91 289 981 27 360 65 436 700 920 99 925 6151. Build this BST.2. Insert into the BST the following numbers:256006056103. Delete
Washington - TCSS - 342
Binary heaps binary tree that satisfy two properties structural property (is a complete tree) heap-ordering property (minimum item on top) Can have maximizing heaps too.1Defining complete trees Perfect binary tree all leaves are at the sam
Washington - TCSS - 342
Graphs G = (V, E) V are the vertices; E are the edges. Edges are of the form (v, w), where v, w V. ordered pair: directed graph or digraph unordered pair: undirected graph weighted graph: A weight or cost can be associated with each edge.1Gra
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Mathematical Principles of Computing I Homework #1 Due: Wednesday, October 6, 2004, 10:30 AM Fall 2004 Ed Hong September 29, 2004Written homework is due at the beginning of class on the day specified. Any
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Autumn 2004, Section B Written Assignment 2 Assigned: Wednesday, October 6, 2004 Due: Wednesday, October 13, 2004, 10:30 AM (start of class) Please show your work and explain your reasoning. Write legibly (o
Washington - TCSS - 342
TCSS 342, Autumn 2004 Homework #4: Sieve of EratosthenesAssigned: Due: Wed 2004/10/20 Mon 2004/10/25, 10:30amYour assignment is to implement the Sieve of Eratosthenes algorithm for finding prime numbers, as describe below, and then analyze it to d
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342, Autumn 2004, Section B Homework #5 (Written Assignment #3) Assigned: Monday, Nov. 1, 2004 Due: Monday, Nov. 8, 2004, 10:30 AM (start of class) Please show your work and explain your reasoning. Write legibly
Washington - TCSS - 342
1TCSS 342B Fall 2004Word Counting Project, version 1.1 writeup.Project #3, (Homework #6)Out: Wednesday, November 10, 2004. Due: Submission in three stages: Part one due November 17, 10:30 AM; use e-submit to turn-in code. Part two due November 2
Washington - TCSS - 342
1TCSS 342B Fall 2004Word Counting Project, Additional notes version 1.0Project #3, (Homework #6)This document contains additional hints on the project, including dealing with stack overflow and HashTable implementation hints. StackOverflow notes
Washington - TCSS - 342
1TCSS 342B Fall 2004Word Counting Project, Additional notes version 1.0Project #3, (Homework #6)This document contains additional hints on the project, including dealing with stack overflow and HashTable implementation hints. StackOverflow notes
Washington - TCSS - 342
University of Washington, Tacoma TCSS 342B, Mathematical Principles of Computing I Due: Wednesday, Dec. 9, 2004, 10:30 AM If you requested it, then you will be assigned a partner. Ideally, you will be able to work together closely and debug and impro
Washington - TCSS - 342
xqzxxqdxyyyyxyyyqqqxqdxxqzxxxqdxqzxqdxqdxxqdxqdxqdxxqzxqzxqzxqzxxqdxqdxqdxqdxqdxxyqdxxyyqdxxyyyqdxxyyyyqdxxqdxyxqdxyyxqdxyyyxyqdxyyxyyyqdxyyyxqdxqzxqdxqdxqd xxqxdyxqyxdxxyyxqdxyxyxyyxqqddxzzyxyyqxzxyyyqzxxqdxyyyyyy