# 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.

8 Pages

### BSTIntroduction

Course: COMP 282, Fall 2009
School: CSU Northridge
Rating:

Word Count: 184

#### Document Preview

282 Lecture COMP 06 Trees: Basic Ops. Terminology Terminology Nodes and edges Parent (generalized: Ancestor) Child (generalized: descendent) Root Leaf Subtrees Binary trees Height of Trees Height of a Tree height 0 0 1 3 7 8 4 5 2 6 2 5 1 2 3 4 Height &quot;Full&quot; Trees For any level l, such that l&lt;=h there are exactly 2l nodes at that level. &quot;Complete&quot;...

Register Now

#### Unformatted Document Excerpt

Coursehero >> California >> CSU Northridge >> COMP 282

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.
282 Lecture COMP 06 Trees: Basic Ops. Terminology Terminology Nodes and edges Parent (generalized: Ancestor) Child (generalized: descendent) Root Leaf Subtrees Binary trees Height of Trees Height of a Tree height 0 0 1 3 7 8 4 5 2 6 2 5 1 2 3 4 Height "Full" Trees For any level l, such that l<=h there are exactly 2l nodes at that level. "Complete" Trees For any level l, such that l<=(h-1) there are exactly 2l nodes at that level. [ The lowest level, l=h may be missing some nodes. "Balanced" Trees For any node, N, in the tree there are approximately has many nodes contained in the left subtree of N as there are in the right subtree. Binary Trees Properties All nodes exactly have one left subtree and one right subtree. (subtrees maybe empty) Operations (basic): createBinaryTree() createBinaryTree(rootItem) makeEmpty() isEmpty() getRootItem() Binary Trees General Operations setRootItem(newItem) attachLeft(newItem) attachRight(newitem) attachLeftSubtree(leftTree) attachRightSubtree(rightTree) detachLeftSubTree() detachRightSubTree() Tree Representations Arrays 0 1 2 3 4 5 6 7 8 0 2 ...

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:

CSU Northridge - LECTURE - 424
COMP 424Lecture 11 Designing Trusted Operating SystemsTrustAn operating system is trusted if we have confidence that it consistently and effectively provides: Memory protection File protection General object access control User authenti
Illinois State - CHE - 232
Organic Chemistry 232Chapter 19 ReviewCarboxylic AcidsQuestions from Vollhardt &amp; Schore: All the QuestionsChapter 19 Overview:A) Carboxylic Acids I) Order of Precedence for Functional Group Nomenclature II) Nomenclature III) Physical Properti
CSU Northridge - LECTURE - 424
COMP424Lecture02SecurityGoals(Requirements)Whatmakesasecuresystem? FinancialSecurityrequirements Homesecurity Homelandsecurity Physicalsecurity ComputersecurityAlltheseconceptsofsecurityhavedifferent requirements.Weare,ofcourse,inter
CSU Northridge - COMP - 282
COMP 282Lecture 04Selection Sort selectionSort(Comparable[] theArray, int n) { int last = n-1; while (last &gt;= 1) { / Find largest item int largest = indexOfLargest(theArray,last+1); / swap largest with current last unsorted position Comparable te
CSU Northridge - COMP - 429
COMP429 Computer Network SoftwareSample Presentation: RIP and OSPFJeff Wiegley, Ph.D. Computer Science jeffw@csun.edu Revised: May 9, 20061Topics Definitions and Introduction. Routing Information Protocol (RIP) Participation and Operation B
N. Georgia - ACWARN - 7734
Mr. Hernandez World History ClassMultimedia Research Project RubricStudent Name: _Topic: _Date: _ SelfScore Teacher ScoreResearch Process:Gathered information from journals, books, CDs, and the internet Resources are current and reliable Ex
CSU Northridge - LECTURE - 424
COMP424Lecture07 VirusandothermalicouscodeHowVirusesAttach Appendedtootherprograms Surroundotherprograms Integrationwithotherprograms ReplacementVirusesthatAppend Easytoprogram Insertedbeforethenonmaliciouscode Viruscodeexecutedfirst
N. Georgia - ACWARN - 7734
Web-Based Lesson PlanLesson Plan Title: Developed by: Subject Area: Grade Level: Purpose of the Activity: Learning Objectives (include at least one Georgia QCC): Lesson URL(s): Equipment Needed: How will you accommodate students with special needs?
CSU Northridge - LECTURE - 424
COMP 424Computer Security Lecture 09 &amp; 10ProtocolAn orderly sequence of steps agreed upon by two or more parties in order to accomplish a task Characteristics of a good protocol Established in advance All parties agree on it Easy to
CSU Northridge - LECTURE - 424
N. Georgia - ACWARN - 7734
Name: _The places you may goDraw a picture of yourself and one other person in a place that you would like to time travel to.Explain who you took with you and where you went. (4 sentences)
CSU Northridge - LECTURE - 424
COMP 424 Computer System SecurityLecture 01 Attacks, Goals and VulnerabilitiesAt one time Bank robbery was common. Now its very rare. What has changed or been implemented to provide this security? What do we mean by &quot;secure&quot;?Sophisticat
CSU Northridge - LECTURE - 424
COMP 424Lecture 04 Advanced Encryption Techniques (DES, AES, RSA)Secret Key SystemsA message M, encrypted with key K is K denoted as [M] . Decryption is done with the same key and K K denoted: [M] ] = M. The basic disadvantage to these syste
CSU Northridge - LECTURE - 424
Computer SecurityCOMP 424 Lecture week 6 Program SecurityProgram Security How do we keep programs free from flaws How do we protect resources against such flaws? Deals with the security aspects involved when writing programs. Chapter 5 will
CSU Northridge - LECTURE - 424
COMP424LectureWeek9 ProtectioninGeneralPurposeOperatingSystemsOperatingSystemsOperatingSystemsandDatabasespresent uniquechallengesinsecurity.DatabasesarecoveredinChapter7Modernoperatingsystems(andevensome oldersystems)aremultiuserand mu
N. Georgia - ACWARN - 7734
The 4 Seasons!By: Miss WarnerThe Fall Fall Starts September 21st School starts Leaves change colors Weather changes Halloween ThanksgivingWinter Winter starts December 21st It gets REALLY cold The trees are bare It could snow Christma
N. Georgia - ACWARN - 7734
Group Members_ _ _Group Project Lesson PlanLesson Plan Title: Developed by: Subject Area: Grade Level: Purpose of the Activity: Learning Objectives (include at least one Georgia QCC): Different Types of Weather Group members listed above Science 4
N. Georgia - ACWARN - 7734
Different types of weatherStudents Names: _ Group #: _ Date: _Component Worksheet was completed. All activities were completed at each station while following instructions Script was written for weather forecast by using research and teamwork. Wea
N. Georgia - ACWARN - 7734
WEATHER ACTIVITY SHEET &quot;Blizzards&quot;At this center you will go to the web site provided, and this one only, to find the answers to the following questions:Web Site: 1. http: / /eo.ucar.edu /webweather/blizzard2.html Questions: 1. What 3 things are ne
CSU Northridge - LECTURE - 429
COMP429 Computer Network SoftwareLecture 04: Address Resolution Protocol (ARP)Jeff Wiegley, Ph.D. Computer Science jeffw@csun.edu Revised: February 15, 20061IntroductionSo now we have the following: Ethernet network segments rely on a 48 bit
CSU Northridge - LECTURE - 424
CSU Northridge - COMP - 282
COMP 282Lecture 03Algorithm Efficiency What is algorithm efficiency? Memory space costs How fast is the task completed* Cost to produce implementations Cost to maintain applications &quot;Method of solutions&quot; vs. programs Significant differenc
CSU Northridge - COMP - 282
COMP 282Lecture 05Merge Sort (pages 393-398) Void merge(Comparable[] theArray, int first, int mid, int last) { Comparable[] tempArray = new Comparable[last-first+1]; int f1 = first; int f2 = mid+1; int index = 0; while (f1&lt;=mid &amp; f2&lt;=last) if (th
CSU Northridge - COMP - 282
COMP282: Advanced Data StructuresLecture 02 COMP182 Review Basic Linear and Logarithmic Structures Arrays Linear Structures [O(n)]0 1 2 3 4 5 6 7 8 9 10 11 12Advantages:Easy to program / built-in to the language Space efficient* Support
CSU Northridge - COMP - 282
COMP 282Lecture 07 Binary Search TreesBinary Search Trees Properties:1. Nodes &quot;value&quot; is greater than all values in its left subtree. 2. Nodes &quot;value&quot; is less than ( ) all values in its right subtree 3. Both the left and right subtrees are also
CSU Northridge - COMP - 424
COMP424 Computer SecurityDesign PrinciplesaJeff Wiegley, Ph.D. Computer Science jeffw@csun.edu 08/29/2005a ByMatt Bishop, &quot;Computer Security&quot;1 The principle of least privilege states that a subject should be given only those privileges that
Virginia Tech - CS - 4234
peanut cashew acorn pecan chestnut macadamia brazilnut pistachio eureka lemon lime fig nectarine plum watermelon cantaloupe honeydew mango peach elderberry mulberry papaya blackberry durian coconut longan strawberry rambuta
RIT - I - 386
Rose-Hulman - ECE - 351
ECE 351 Exam 1 Spring 2003Name_ Section_ CM_Scores: 1) 2) 3) 4)Total_I pledge on my honor that I did not copy any of this exam, and that this work is entirely my own. Furthermore, I did not use PSpice during this exam. _ Page 1 of 10Problem 1
Rose-Hulman - ECE - 351
ECE 351 Exam 2 Spring 2003Name_ Section_ CM_Scores: 1) 2) 3)Total_I pledge on my honor that I did not copy any of this exam, and that this work is entirely my own. Furthermore, I did not use PSpice during this exam. _Page 1 of 8Problem 1 (5
Rose-Hulman - ECE - 351
ECE 351 Final Exam-2 Spring 2003Name_ Section_ CM_Scores: 1) 2) 3) 4)Total_I pledge on my honor that I did not copy any of this exam, and that this work is entirely my own. Furthermore, I did not use PSpice during this exam. _ Page 1 of 9Prob
Rose-Hulman - ECE - 351
ECE 351 Final Exam Spring 2003Name_ Section_ CM_Scores: 1) 2) 3) 4)Total_I pledge on my honor that I did not copy any of this exam, and that this work is entirely my own. Furthermore, I did not use PSpice during this exam. _ Page 1 of 10Probl
Rose-Hulman - ECE - 351
vti_encoding:SR|utf8-nl vti_timelastmodified:TR|04 Apr 2003 13:40:10 -0000 vti_extenderversion:SR|5.0.2.4330 vti_author:SR|HERNITER-1\herniter vti_modifiedby:SR|HERNITER-1\herniter vti_timecreated:TR|04 Apr 2003 13:40:10 -0000 vti_cacheddtm:TX|04 Apr
Rose-Hulman - ECE - 351
vti_encoding:SR|utf8-nl vti_timelastmodified:TR|09 May 2003 02:30:11 -0000 vti_extenderversion:SR|5.0.2.4330 vti_author:SR|HERNITER-1\herniter vti_modifiedby:SR|HERNITER-1\herniter vti_timecreated:TR|09 May 2003 02:30:11 -0000 vti_cacheddtm:TX|09 May
Rose-Hulman - ECE - 351
vti_encoding:SR|utf8-nl vti_timelastmodified:TR|28 May 2003 19:09:16 -0000 vti_extenderversion:SR|5.0.2.4330 vti_author:SR|HERNITER-1\herniter vti_modifiedby:SR|HERNITER-1\herniter vti_timecreated:TR|28 May 2003 19:09:16 -0000 vti_cacheddtm:TX|28 May
Rose-Hulman - ECE - 351
vti_encoding:SR|utf8-nl vti_timelastmodified:TR|28 May 2003 02:39:54 -0000 vti_extenderversion:SR|5.0.2.4330 vti_author:SR|HERNITER-1\herniter vti_modifiedby:SR|HERNITER-1\herniter vti_timecreated:TR|28 May 2003 02:39:54 -0000 vti_cacheddtm:TX|28 May
RIT - MJW - 7675
EE772 Artificial Neural Networks Final Paper Rochester Institute of Technology1Musical Preference Learning Neural Network Design and AnalysisMatthew J. WaldronAbstract- Increasing availability and variety of music today makes it easier for
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: ans2ed.dvi %CreationDate: Sat Sep 07 13:21:19 2002 %Pages: 8 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSComman
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: ans2ed.dvi %CreationDate: Sat Sep 07 13:21:19 2002 %Pages: 7 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSComman
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: ans2ed.dvi %Pages: 9 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: AvantGarde-Demi AvantGarde-BookOblique Bookman-Light %+ CMBX12 CMR10 CMR12 CMCSC10 CM
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: question.dvi %Pages: 1 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: CMR10 CMSY10 CMMI10 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommand
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: ans2ed.dvi %Pages: 1 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: AvantGarde-Demi AvantGarde-BookOblique Bookman-Light %+ CMBX12 CMR10 CMR12 CMCSC10 CM
Maple Springs - CSE - 4411
Physical Database DesignChapter 16, Part ADatabase Management Systems 3ed, R. Ramakrishnan and J. Gehrke1OverviewAfter ER design, schema refinement, and the definition of views, we have the conceptual and external schemas for our database.
Maple Springs - CSE - 4411
Maple Springs - CSE - 4411
HashBased IndexesChapter 11Implementation of Database Systems, Jarek Gryz1IntroductionAs for any index, 3 alternatives for data entries k*: Data record with key value k &lt;k, rid of data record with search key value k&gt; &lt;k, list of rids of
Maple Springs - CSE - 4411
Evaluation of Relational OperationsChapter 14, Part AImplementation of Database Systems, Jarek GryzRelational OperationsWe will consider how to implement: Selection ( ) Selects a subset of rows from relation. Projection (
Maple Springs - CSE - 4411
Evaluation of Relational Operations: Other TechniquesChapter 14, Part BImplementation of Database Systems, Jarek Gryz1Simple Selections SELECT * FROM Reserves R WHERE R.rname &lt; `C%' Of the form R. attr op value ( R) Size of res
Maple Springs - CSE - 4411
Relational Query OptimizationChapters 12Implementation of Database Systems, Jarek Gryz1Overview of Query OptimizationPlan: Tree of R.A. ops, with choice of alg for each op. Each operator typically implemented using a `pull' interface: wh
Maple Springs - CSE - 4411
External SortingChapter 13Implementation of Database Systems, Jarek Gryz1Why Sort? A classic problem in computer science! Data requested in sorted order e.g., find students in increasing gpa orderSorting is first step in bulk loadin
Maple Springs - CSE - 4411
TreeStructured IndexesChapter 10Implementation of Database Systems, Jarek Gryz1IntroductionAs for any index, 3 alternatives for data entries k*: 1. Data record with key value k 2. &lt;k, rid of data record with search key value k&gt; 3. &lt;k, list o
Berkeley - EECS - 12203
Project 3: ns Simulation of ApplicationLevel RoutingImprove the application performance by user-level / application-level routing. Understand the use of network measurement and user decisions in network route selection.EECS122 UCB1Scenar
Berkeley - EECS - 12203
Measurements and Modeling Table of Contents1. Measurements 2. Modeling and its Shortcomings 3. Example of a Network Simulator: NSEECS122 - UCB1Problem with MeasurementsReal System measure ResultReal system does not exist Implementation of r
Berkeley - EECS - 12203
EECS122 Communications Networks Socket ProgrammingJanuary 30th, 2003Jrn AltmannQuestions that will be Addressed During the LectureWhat mechanisms are available for a programmer who writes network applications? How to write a network applicati
Berkeley - EECS - 12203
CC2: Fast Links Imagine a 10 Gbps link Assume MSS = 10kbits, RTT = 100 ms Slow Start: CA:After n RTT, window = 2n 110kbits, so that the rate is 2n 1100kbps The rate reaches 10Gbps when 2n 1 = 105, i.e., when n = 17, which takes about
Berkeley - EECS - 12203
EE122 ProjectHigh Level DescriptionGoalTo use an interactive network simulation environment that allows students to how endtoend and network control mechanisms affect various measures of latency and loss How do AIMD protocols perform?
Berkeley - EECS - 12203
EECS 122 Communications NetworksDepartment of Electrical Engineering and Computer SciencesUniversity of California BerkeleySlides: K. Fall, K. Lai, A. Parekh, I. Stoica, J. Walrand Help from J. AltmannTable of Contents1. 2. 3. 4. 5. 6. 7. 8. 9
Berkeley - EECS - 12203
Berkeley - EECS - 12203
#%-12345X@PJL JOB @PJL ENTER LANGUAGE = POSTSCRIPT %!PS-Adobe-3.0 %Title: Microsoft PowerPoint - congestion.ppt %Creator: PScript5.dll Version 5.2 %CreationDate: 2/13/2003 10:37:34 %For: wlr %BoundingBox: (atend) %Pages: (atend) %Orientation: Portrai
Berkeley - EECS - 12203
Applications: DNS, HTTP and the WWWEECS 122: Lecture 6Department of Electrical Engineering and Computer SciencesUniversity of California BerkeleyWhat we've covered so far.Basic Background General Overview of different kinds of networks G
Berkeley - EECS - 12203
Department of EECS - University of California at Berkeley EECS122 - Communication Networks - Spring 2003 Instructors: Abhay Parekh &amp; Jean Walrand Homework Assignment No. 2 Assigned: February 25, 2003 - Due: March 6, 2003Problem 1 (20%). Generalizin
Berkeley - EECS - 12203
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: hw2 questions.dvi %CreationDate: Thu Feb 27 11:07:19 2003 %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMR12 CMBX12 CMMI12 CMMI8 CMSY10 %EndC