Trees. Tree Definitions: Let T = (V, E, r) be a tree. The size of a tree denotes the number of nodes of the tree.

Save this PDF as:

Size: px
Start display at page:

Download "Trees. Tree Definitions: Let T = (V, E, r) be a tree. The size of a tree denotes the number of nodes of the tree."

Transcription

1 Trees After lists (including stacks and queues) and hash tables, trees represent one of the most widely used data structures. On one hand trees can be used to represent objects that are recursive in nature (including programming, logical, and arithmetic expressions), as well as structured data, such as data stored in XML documents. On the other hand, trees are often used as the basis for more advanced data structures, including binary search trees. Tree Definitions: Let T = (V, E, r) be a tree. The size of a tree denotes the number of nodes of the tree. For v V, parent(v) denotes the unique u V such that (u, v) E. Note that parent(r) is undefined, but is defined for every other node. For u V, children(u) = v (u, v) E. leaf: any node n for which children(n) =. A node that is not a leaf is called an internal node. For v V, siblings(v) = u (parent(v), u) E For v V, depth(v) = length of the path (in terms of number of edges traversed) from the root to v. For v V, height(v) = length of longest path from v to a leaf of T. The height of T is defined as height(r). T is called m-ary iff v V, children(v) m. T is called binary iff the property holds for m = 2. If T is m-ary, then it is called full iff every internal node has exactly m children. It is called perfect if it is full, and every leaf of T has the same depth. 1

2 2

3 Tree Implementation. The most common type of tree to implement is the binary tree. public class BinaryTree Object root; BinaryTree left; //reference to left child BinaryTree right; //reference to right child ; For general trees, the left and right references are replaced with a single reference to the list of subtrees that are rooted at the given node that stores the data. public class Tree Object root; List children; //a list of Trees that are rooted at root Note: some implementations will include a reference to the parent of the tree. This can seem useful in some applications. 3

4 Example 1. Implement a method for the BinaryTree class above that provides the height of the binary tree. Example 2. Implement a method for the BinaryTree class above that provides the size of the binary tree. 4

5 Example 3. Implement a method for the BinaryTree class above that finds the first binary subtree (according to the tree pre-ordering) whose root is equal to that of some given object. 5

6 Binary Search Trees A binary search tree is a binary tree T = (V, E, r) such that the objects stored in the tree are totally ordered via some ordering relation <. A binary search tree data structure is defined similarly to that of a BinaryTree, but now the root must be an Ordered object. Moreover, for each node n of the tree we have the following statements holding. if n 1 is a left descendant of n, then n 1 < n. if n 2 is a right descendant of n, then n 1 > n. Example 4. A binary search tree is to be constructed by adding integer nodes (in the order in which they are shown) n 1, n 2,..., n 7 to an initially empty tree. If the integer values of the nodes are respectively 5, 8, 2, 9, 6, 10, 1, what will the tree look like? 6

7 Binary search trees are mostly used for the purpose of efficiently finding stored data. Finding data with a bst is efficient since one only needs to search along one of the branches of the tree, as opposed to an array which would require searching through possibly the entire set of data. For these reasons, the following operations are considered most essential: insert(): insert an object into the tree find(): find an object in the tree find min(): find the least object in the tree find max(): find the greatest object in the tree delete(): delete an object from the tree 7

8 //Insert obj into the this bst. //Assume obj is currently not in the tree. public void insert(ordered obj) if(obj.compare(root) < 0) //insert into left subtree if(root.left == null) root.left = new BinarySearchTree(obj); else root.left.insert(obj); //insert into right subtree if(root.right == null) root.right = new BinarySearchTree(obj); else root.right.insert(obj); Example 5. Insert a node with integer value 7 into the tree constructed during Example 4. 8

9 //find and return a stored object equal to obj Object find(ordered obj) int value = root.compare(obj); if(value == 0) return root; if(value < 0) //look in left subtree if(root.left == null) return null; return root.left.find(obj); //must be in right subtree if(root.right == null) return null; return root.right.find(obj); Example 6. Trace through the find algorithm using the tree from Example 4, and using inputs 7, and 12. 9

10 //find and return the least element Object minimum() if(root.left == null) return root; return root.left.minimum(); 10

11 Deleting a binary-search-tree node n: case 1: n has no children. Then directly removing n does not affect the bst. case 2: n has one child. Upon removing n make child(n) a child of parent(n). case 3: n has two children. Replace n with the least right descendant n of n. n will have at most one child, so either case 1 or case 2 applies to its relocation. Example 7. Demonstrate all three cases using the tree from Example 4. 11

12 Complexity analysis of bst operations worst case: occurs when all n data exist on one branch of the tree. In this case, all operations will equal O(n). best case: occurs when the bst is perfect. In this case the tree will have depth log n and the complexity of all operations equal O(log n). average case: the average-case complexity depends on the average length of a node in randomly constructed tree. Theorem: The average length of a node in a randomly constructed binary search tree is O(log n). Proof: Given a tree T, the sum of the depths of all the nodes of the tree is called the internal path length. Let D(n) denote the internal path length of a binary tree having n nodes. Then D(1) = 0 and, for n > 1, D(n) = D(i) + D(n i 1) + n 1, assuming that the tree has i nodes in its left subtree, and n i 1 nodes in its right subtree. The n 1 term comes from the fact that D(i) and D(n i 1) gives a measurement of the internal path lengths of the left and right subtrees from the perspective that both roots start at depth 0. But since they are subtrees of one level down, each of the n 1 nodes will have an extra unit of depth. Hence, we must add n 1 to the recurrence relation. Now, in the case of a binary search tree for which the root node is randomly selected from a list of n choices, each with equal probability, we see that the average internal path length for a randomly constructed tree is 1 [(D(0) + D(n 1) + (n 1)) + (D(1) + D(n 2) + (n 1)) + + (D(n 1) + D(0) + (n 1))] = n 2 n 1 D(i) + (n 1). n i=0 We now show that this recurrence relation yields D(n) = O(n log n). We prove this by induction. To begin, we certainly can find a constant C > 0 such that D(1) = 0 C 1 log 1 = 0. Any C will work. Now assume that there is a constant C > 0 such that, for all m < n, D(m) Cm log m. We now show that D(n) Cn log n, by choosing the right condition on C. To start, D(n) = 2 n 1 D(i) + (n 1) n i=0 12

13 (by the inductive assumption) 2 n 2 n 1 Ci log i + (n 1) n i=0 n 1 2 n (Cn2 2 log n 1 2 ln 2 Cx log xdx + (n 1) = n 1 xdx) + (n 1) = Cn log n C(n2 1) + (n 1) Cn log n, 2n ln 2 provided that C > 2 ln 2 = ln 4, and n is sufficiently large. Therefore, the average internal path length is D(n) = O(n log n). Dividing this quanity by n yields the average depth of a node in a randomly generated binary search tree, which in this case is O(log n). Note: this same analysis can be used to analyze the average-case running time of Quicksort when the median is chosen at random. 13

14 Exercises. 1. Prove that, when a binary tree with n nodes is implemented by using links to the left and right child (as was done in the BinarySearchTree class), then there will be a total of n + 1 null links. 2. Prove that the maximum number of nodes in a binary tree with height h is 2 h A full node for a binary tree is one that has two children. Prove that the number of full nodes plus one equals the number of leaves of a binary tree. 4. Using the BinaryTree class described in lecture, write a class method for deciding if a binary tree is balanced. Hint: a binary tree is balanced if the heights of its left and right subtrees are no more than 1 apart in absolute value, and both its left and right subtrees are balanced. Note: an empty tree is assumed to have a height of Using the BinaryTree class described in lecture, and assuming the data is of type integer, write a class method for deciding if a binary tree is a binary search tree. 6. Using the BinaryTree data structure described in lecture and assuming that the data is of type integer, and that the tree is a binary search tree, write a function that prints in order the integers stored in the tree. 7. Suppose a binary search tree is to hold keys 1,4,5,10,16,17,21. Draw possible binary search trees for these keys, and having heights 2,3,4,5, and 6. For each tree, compute its internal path length. Hint: the height-2 tree should be a perfect tree. 8. Write a method called print() for the BinarySearchTree class presented in lecture, and which prints all the objects of the tree in sorted order. You may assume that each object has a tostring() method that may be called. 9. Prove that it takes Ω(n log n) steps in the best case to build a binary search tree having n keys. Show work and explain. 10. Suppose we have a bst that stores keys between 1 and If we perform a find on key 363, then which of the following sequences could not be the sequence of nodes examined when performing using the find() method provided in lecture. a) 2,252,401,398,330,344,397 b) 924,220,911,244,898,258,362,363 c) 925,202,911,240,912,245,363 d) 2,399,387,219,266,382,381,278,363 e) 935,278,347,621,299,392,358, Suppose a bst is constructed by repeatedly inserting distinct keys into the tree. Argue that the number of nodes examined when searching for a key is equal to one more than the number examined when inserting that key. 12. Prove or disprove: deleting keys x and y from a bst is commutative. In other words, it does not matter which order the keys are deleted. The final trees will be identical. If true, provide a proof. If false, provide a counterexample. 14

15 13. Consider a branch of a binary search tree. This branch divides the tree into three sets: set A, the elements to the left of the branch; set B, the elements on the branch; and set C, the elements to the right of the branch. Provide a small counterexample to the statement for all a A, b B, and c C, a b c. 14. Consider a bst T whose keys are distinct. We call key y a successor of key x iff y > x and there is no key z for which y > z > x. Show that if the right subtree of the node storing key x in T is empty and x has a successor y, then the node that stores y must be the lowest ancestor of x whose left child is also an ancestor of x. Show two examples of this, one in which y is the parent of x, and one for which y is not the parent of x. Label both x and y. 15

16 Exercise Hints and Answers. 1. Using mathematical induction, if there is one node, then there are 2 null links. Now suppose a tree with n nodes has n + 1 null links. Let T be a tree with n + 1 nodes, and l a leaf of T. Removing l from T yields a tree with n nodes, and hence n + 1 null links (by the inductive assumption). Hence, adding l back to T removes one null link, but adds two more, which implies that T has n = n + 2 null links. 2. This follows from the identity h = 2 h Proof by induction. If a tree has one node then it has 0 full nodes, and 0+1 leaves. Now suppose that a tree with n full nodes has n + 1 leaves. Let T be a tree with n + 1 full nodes. Let l be a leaf of T. If the parent of l is not full, then removing l from T produces a new tree with the same number of leaves and full nodes. So, by continually plucking leaves from T, eventually we will find a leaf l whose parent is full. In this case, removing l from T produces a tree with n full nodes and hence, by the inductive assumption, n + 1 leaves. Thus, T must have n = n + 2 leaves. 4. boolean is_balanced() if(left!= null) if(!left.is_balanced()) return false; if(right!= null) if(!right.is_balanced()) return false; return abs(left.height()-right.height()) <= 1 return left.height() == 0; if(right == null) return true; return right.height() == 0; 5. boolean is_bst() if(left!= null) if(!left.is_bst()) return false; 16

17 int max = left.maximum(); if(maximum >= root) return false; if(right!= null) if(!right.is_bst()) return false; int min = right.minimum(); return minimum > root; return true; if(right == null) return true; int min = right.minimum(); return minimum > root; 6. void print() if(left!= null) left.print(); print root; if(right!= null) right.print(); print root; if(right!= null) right.print() 7. height 2: insert in the order of 10,4,17,1,5,16,21; height 4: insert in the order of 16,10,5,4,1,17,21, height 6: insert in order 21,17,16,10,5,4,1 Internal path lengths: height 2 = 7, height 4 = 13, height 6 = See Exercise 6. 17

18 9. Best case number of steps for i th key is O( log i ). Hence, T (n) = Ω( n log i) = Ω(n log n) by the Integral theorem. 10. a) No. Does not end with 363 c) No. 912 cannot be in the left subtree of 911 i=1 11. True since the key will be found along exactly the same path that it was inserted. 12. Hint: consider the binary search tree with nodes inserted in the following order: 1,10,5,2,8,7,9 13. Use the tree of the previous problem. 14. If y is the parent of x and x is the left child of y, then the statement is true, since technically x is an ancestor of itself. So suppose y is not the parent of x. Consider the first ancestor y of x whose left child is also an ancestor of x. Then we must have x < y and x > z for every descendant z of y that lies between y and x (exclusive) on the branch from y to x. It remains to show that there can be no element z for which x < z < y. Certainly no such z will be found in the left subtree of y, since x has no right subtree, and every ancestor of x between y and x (exclusive) is less than x. Also, no such z will be found in the right subtree of y, since all these elements are greater than y. Moreover, for any ancestor z of y, if y is in z s left subtree, then z > y. If y is in z s right subtree, then y > z, but also x > z. Finally, if z is an element for which z is in one subtree of some ancestor a of y, while y is in the other subtree, then, if y < a, then y < z. Similarly, if y > a, then y > z. But also, x > a, and hence x > z. Therefore, no such z can exist. Note: we call this a proof by cases. 18

Analysis of Algorithms I: Binary Search Trees

Analysis of Algorithms I: Binary Search Trees Xi Chen Columbia University Hash table: A data structure that maintains a subset of keys from a universe set U = {0, 1,..., p 1} and supports all three dictionary

Full and Complete Binary Trees

Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

Binary Search Trees CMPSC 122

Binary Search Trees CMPSC 122 Note: This notes packet has significant overlap with the first set of trees notes I do in CMPSC 360, but goes into much greater depth on turning BSTs into pseudocode than

Binary Search Trees. Data in each node. Larger than the data in its left child Smaller than the data in its right child

Binary Search Trees Data in each node Larger than the data in its left child Smaller than the data in its right child FIGURE 11-6 Arbitrary binary tree FIGURE 11-7 Binary search tree Data Structures Using

Binary Trees and Huffman Encoding Binary Search Trees

Binary Trees and Huffman Encoding Binary Search Trees Computer Science E119 Harvard Extension School Fall 2012 David G. Sullivan, Ph.D. Motivation: Maintaining a Sorted Collection of Data A data dictionary

Ordered Lists and Binary Trees

Data Structures and Algorithms Ordered Lists and Binary Trees Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/62 6-0:

Binary Search Trees (BST)

Binary Search Trees (BST) 1. Hierarchical data structure with a single reference to node 2. Each node has at most two child nodes (a left and a right child) 3. Nodes are organized by the Binary Search

Outline BST Operations Worst case Average case Balancing AVL Red-black B-trees. Binary Search Trees. Lecturer: Georgy Gimel farb

Binary Search Trees Lecturer: Georgy Gimel farb COMPSCI 220 Algorithms and Data Structures 1 / 27 1 Properties of Binary Search Trees 2 Basic BST operations The worst-case time complexity of BST operations

Converting a Number from Decimal to Binary

Converting a Number from Decimal to Binary Convert nonnegative integer in decimal format (base 10) into equivalent binary number (base 2) Rightmost bit of x Remainder of x after division by two Recursive

Binary Search Trees. A Generic Tree. Binary Trees. Nodes in a binary search tree ( B-S-T) are of the form. P parent. Key. Satellite data L R

Binary Search Trees A Generic Tree Nodes in a binary search tree ( B-S-T) are of the form P parent Key A Satellite data L R B C D E F G H I J The B-S-T has a root node which is the only node whose parent

Questions 1 through 25 are worth 2 points each. Choose one best answer for each.

Questions 1 through 25 are worth 2 points each. Choose one best answer for each. 1. For the singly linked list implementation of the queue, where are the enqueues and dequeues performed? c a. Enqueue in

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The

From Last Time: Remove (Delete) Operation

CSE 32 Lecture : More on Search Trees Today s Topics: Lazy Operations Run Time Analysis of Binary Search Tree Operations Balanced Search Trees AVL Trees and Rotations Covered in Chapter of the text From

Data Structures Fibonacci Heaps, Amortized Analysis

Chapter 4 Data Structures Fibonacci Heaps, Amortized Analysis Algorithm Theory WS 2012/13 Fabian Kuhn Fibonacci Heaps Lacy merge variant of binomial heaps: Do not merge trees as long as possible Structure:

root node level: internal node edge leaf node CS@VT Data Structures & Algorithms 2000-2009 McQuain

inary Trees 1 A binary tree is either empty, or it consists of a node called the root together with two binary trees called the left subtree and the right subtree of the root, which are disjoint from each

AS-2261 M.Sc.(First Semester) Examination-2013 Paper -fourth Subject-Data structure with algorithm

AS-2261 M.Sc.(First Semester) Examination-2013 Paper -fourth Subject-Data structure with algorithm Time: Three Hours] [Maximum Marks: 60 Note Attempts all the questions. All carry equal marks Section A

Balanced Binary Search Tree

AVL Trees / Slide 1 Balanced Binary Search Tree Worst case height of binary search tree: N-1 Insertion, deletion can be O(N) in the worst case We want a tree with small height Height of a binary tree with

Data Structures and Algorithms

Data Structures and Algorithms CS245-2016S-06 Binary Search Trees David Galles Department of Computer Science University of San Francisco 06-0: Ordered List ADT Operations: Insert an element in the list

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:

Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)

A binary search tree is a binary tree with a special property called the BST-property, which is given as follows:

Chapter 12: Binary Search Trees A binary search tree is a binary tree with a special property called the BST-property, which is given as follows: For all nodes x and y, if y belongs to the left subtree

Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr;

50 20 70 10 30 69 90 14 35 68 85 98 16 22 60 34 (c) Execute the algorithm shown below using the tree shown above. Show the exact output produced by the algorithm. Assume that the initial call is: prob3(root)

Merge Sort. 2004 Goodrich, Tamassia. Merge Sort 1

Merge Sort 7 2 9 4 2 4 7 9 7 2 2 7 9 4 4 9 7 7 2 2 9 9 4 4 Merge Sort 1 Divide-and-Conquer Divide-and conquer is a general algorithm design paradigm: Divide: divide the input data S in two disjoint subsets

Chapter 14 The Binary Search Tree

Chapter 14 The Binary Search Tree In Chapter 5 we discussed the binary search algorithm, which depends on a sorted vector. Although the binary search, being in O(lg(n)), is very efficient, inserting a

Binary Heap Algorithms

CS Data Structures and Algorithms Lecture Slides Wednesday, April 5, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org 2005 2009 Glenn G. Chappell

Algorithms and Data Structures

Algorithms and Data Structures Part 2: Data Structures PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering (CiE) Summer Term 2016 Overview general linked lists stacks queues trees 2 2

1 2-3 Trees: The Basics

CS10: Data Structures and Object-Oriented Design (Fall 2013) November 1, 2013: 2-3 Trees: Inserting and Deleting Scribes: CS 10 Teaching Team Lecture Summary In this class, we investigated 2-3 Trees in

Binary Heaps. CSE 373 Data Structures

Binary Heaps CSE Data Structures Readings Chapter Section. Binary Heaps BST implementation of a Priority Queue Worst case (degenerate tree) FindMin, DeleteMin and Insert (k) are all O(n) Best case (completely

GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

Section IV.1: Recursive Algorithms and Recursion Trees

Section IV.1: Recursive Algorithms and Recursion Trees Definition IV.1.1: A recursive algorithm is an algorithm that solves a problem by (1) reducing it to an instance of the same problem with smaller

Heap. Binary Search Tree. Heaps VS BSTs. < el el. Difference between a heap and a BST:

Heaps VS BSTs Difference between a heap and a BST: Heap el Binary Search Tree el el el < el el Perfectly balanced at all times Immediate access to maximal element Easy to code Does not provide efficient

TREE BASIC TERMINOLOGIES

TREE Trees are very flexible, versatile and powerful non-liner data structure that can be used to represent data items possessing hierarchical relationship between the grand father and his children and

12 Abstract Data Types

12 Abstract Data Types 12.1 Source: Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT).

Lecture Notes on Binary Search Trees

Lecture Notes on Binary Search Trees 15-122: Principles of Imperative Computation Frank Pfenning André Platzer Lecture 17 October 23, 2014 1 Introduction In this lecture, we will continue considering associative

Data Structures and Algorithms Written Examination

Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where

Lecture Notes on Binary Search Trees

Lecture Notes on Binary Search Trees 15-122: Principles of Imperative Computation Frank Pfenning Lecture 17 March 17, 2010 1 Introduction In the previous two lectures we have seen how to exploit the structure

Tree Properties (size vs height) Balanced Binary Trees

Tree Properties (size vs height) Balanced Binary Trees Due now: WA 7 (This is the end of the grace period). Note that a grace period takes the place of a late day. Now is the last time you can turn this

Heaps & Priority Queues in the C++ STL 2-3 Trees

Heaps & Priority Queues in the C++ STL 2-3 Trees CS 3 Data Structures and Algorithms Lecture Slides Friday, April 7, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks

Lecture 6: Binary Search Trees CSCI 700 - Algorithms I. Andrew Rosenberg

Lecture 6: Binary Search Trees CSCI 700 - Algorithms I Andrew Rosenberg Last Time Linear Time Sorting Counting Sort Radix Sort Bucket Sort Today Binary Search Trees Data Structures Data structure is a

Exam study sheet for CS2711. List of topics

Exam study sheet for CS2711 Here is the list of topics you need to know for the final exam. For each data structure listed below, make sure you can do the following: 1. Give an example of this data structure

B-Trees. Algorithms and data structures for external memory as opposed to the main memory B-Trees. B -trees

B-Trees Algorithms and data structures for external memory as opposed to the main memory B-Trees Previous Lectures Height balanced binary search trees: AVL trees, red-black trees. Multiway search trees:

A binary heap is a complete binary tree, where each node has a higher priority than its children. This is called heap-order property

CmSc 250 Intro to Algorithms Chapter 6. Transform and Conquer Binary Heaps 1. Definition A binary heap is a complete binary tree, where each node has a higher priority than its children. This is called

Lecture 1: Course overview, circuits, and formulas

Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D. base address 2. The memory address of fifth element of an array can be calculated

Binary Heaps * * * * * * * / / \ / \ / \ / \ / \ * * * * * * * * * * * / / \ / \ / / \ / \ * * * * * * * * * *

Binary Heaps A binary heap is another data structure. It implements a priority queue. Priority Queue has the following operations: isempty add (with priority) remove (highest priority) peek (at highest

Binary Search Trees > = Binary Search Trees 1. 2004 Goodrich, Tamassia

Binary Search Trees < 6 2 > = 1 4 8 9 Binary Search Trees 1 Binary Search Trees A binary search tree is a binary tree storing keyvalue entries at its internal nodes and satisfying the following property:

Intro. to the Divide-and-Conquer Strategy via Merge Sort CMPSC 465 CLRS Sections 2.3, Intro. to and various parts of Chapter 4

Intro. to the Divide-and-Conquer Strategy via Merge Sort CMPSC 465 CLRS Sections 2.3, Intro. to and various parts of Chapter 4 I. Algorithm Design and Divide-and-Conquer There are various strategies we

The following themes form the major topics of this chapter: The terms and concepts related to trees (Section 5.2).

CHAPTER 5 The Tree Data Model There are many situations in which information has a hierarchical or nested structure like that found in family trees or organization charts. The abstraction that models hierarchical

Data Structures, Practice Homework 3, with Solutions (not to be handed in)

Data Structures, Practice Homework 3, with Solutions (not to be handed in) 1. Carrano, 4th edition, Chapter 9, Exercise 1: What is the order of each of the following tasks in the worst case? (a) Computing

Algorithms and Data Structures Written Exam Proposed SOLUTION

Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are

CSE 326: Data Structures B-Trees and B+ Trees

Announcements (4//08) CSE 26: Data Structures B-Trees and B+ Trees Brian Curless Spring 2008 Midterm on Friday Special office hour: 4:-5: Thursday in Jaech Gallery (6 th floor of CSE building) This is

Operations: search;; min;; max;; predecessor;; successor. Time O(h) with h height of the tree (more on later).

Binary search tree Operations: search;; min;; max;; predecessor;; successor. Time O(h) with h height of the tree (more on later). Data strutcure fields usually include for a given node x, the following

Sorting revisited. Build the binary search tree: O(n^2) Traverse the binary tree: O(n) Total: O(n^2) + O(n) = O(n^2)

Sorting revisited How did we use a binary search tree to sort an array of elements? Tree Sort Algorithm Given: An array of elements to sort 1. Build a binary search tree out of the elements 2. Traverse

Learning Outcomes. COMP202 Complexity of Algorithms. Binary Search Trees and Other Search Trees

Learning Outcomes COMP202 Complexity of Algorithms Binary Search Trees and Other Search Trees [See relevant sections in chapters 2 and 3 in Goodrich and Tamassia.] At the conclusion of this set of lecture

The ADT Binary Search Tree The Binary Search Tree is a particular type of binary tree that enables easy searching for specific items. Definition The ADT Binary Search Tree is a binary tree which has an

Previous Lectures. B-Trees. External storage. Two types of memory. B-trees. Main principles

B-Trees Algorithms and data structures for external memory as opposed to the main memory B-Trees Previous Lectures Height balanced binary search trees: AVL trees, red-black trees. Multiway search trees:

Sample Questions Csci 1112 A. Bellaachia

Sample Questions Csci 1112 A. Bellaachia Important Series : o S( N) 1 2 N N i N(1 N) / 2 i 1 o Sum of squares: N 2 N( N 1)(2N 1) N i for large N i 1 6 o Sum of exponents: N k 1 k N i for large N and k

Cpt S 223. School of EECS, WSU

Priority Queues (Heaps) 1 Motivation Queues are a standard mechanism for ordering tasks on a first-come, first-served basis However, some tasks may be more important or timely than others (higher priority)

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139 Instructions: No aides. Turn off all electronic media and store them under your desk. If

Classification/Decision Trees (II)

Classification/Decision Trees (II) Department of Statistics The Pennsylvania State University Email: jiali@stat.psu.edu Right Sized Trees Let the expected misclassification rate of a tree T be R (T ).

Optimal Binary Search Trees Meet Object Oriented Programming

Optimal Binary Search Trees Meet Object Oriented Programming Stuart Hansen and Lester I. McCann Computer Science Department University of Wisconsin Parkside Kenosha, WI 53141 {hansen,mccann}@cs.uwp.edu

Analysis of Algorithms I: Optimal Binary Search Trees

Analysis of Algorithms I: Optimal Binary Search Trees Xi Chen Columbia University Given a set of n keys K = {k 1,..., k n } in sorted order: k 1 < k 2 < < k n we wish to build an optimal binary search

UNIVERSITI MALAYSIA SARAWAK KOTA SAMARAHAN SARAWAK PSD2023 ALGORITHM & DATA STRUCTURE

STUDENT IDENTIFICATION NO UNIVERSITI MALAYSIA SARAWAK 94300 KOTA SAMARAHAN SARAWAK FAKULTI SAINS KOMPUTER & TEKNOLOGI MAKLUMAT (Faculty of Computer Science & Information Technology) Diploma in Multimedia

Algorithms Chapter 12 Binary Search Trees

Algorithms Chapter 1 Binary Search Trees Outline Assistant Professor: Ching Chi Lin 林 清 池 助 理 教 授 chingchi.lin@gmail.com Department of Computer Science and Engineering National Taiwan Ocean University

CS711008Z Algorithm Design and Analysis

CS711008Z Algorithm Design and Analysis Lecture 7 Binary heap, binomial heap, and Fibonacci heap 1 Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 The slides were

Sequential Data Structures

Sequential Data Structures In this lecture we introduce the basic data structures for storing sequences of objects. These data structures are based on arrays and linked lists, which you met in first year

Why Use Binary Trees?

Binary Search Trees Why Use Binary Trees? Searches are an important application. What other searches have we considered? brute force search (with array or linked list) O(N) binarysearch with a pre-sorted

Algorithms and Data Structures

Algorithms and Data Structures CMPSC 465 LECTURES 20-21 Priority Queues and Binary Heaps Adam Smith S. Raskhodnikova and A. Smith. Based on slides by C. Leiserson and E. Demaine. 1 Trees Rooted Tree: collection

Data Structure with C

Subject: Data Structure with C Topic : Tree Tree A tree is a set of nodes that either:is empty or has a designated node, called the root, from which hierarchically descend zero or more subtrees, which

Introduction to Algorithms March 10, 2004 Massachusetts Institute of Technology Professors Erik Demaine and Shafi Goldwasser Quiz 1.

Introduction to Algorithms March 10, 2004 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Quiz 1 Quiz 1 Do not open this quiz booklet until you are directed

CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.

Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure

Quiz 1 Solutions. (a) T F The height of any binary search tree with n nodes is O(log n). Explain:

Introduction to Algorithms March 9, 2011 Massachusetts Institute of Technology 6.006 Spring 2011 Professors Erik Demaine, Piotr Indyk, and Manolis Kellis Quiz 1 Solutions Problem 1. Quiz 1 Solutions True

Symbol Tables. Introduction

Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. The

In our lecture about Binary Search Trees (BST) we have seen that the operations of searching for and inserting an element in a BST can be of the

In our lecture about Binary Search Trees (BST) we have seen that the operations of searching for and inserting an element in a BST can be of the order O(log n) (in the best case) and of the order O(n)

6 March 2007 1. Array Implementation of Binary Trees

Heaps CSE 0 Winter 00 March 00 1 Array Implementation of Binary Trees Each node v is stored at index i defined as follows: If v is the root, i = 1 The left child of v is in position i The right child of

Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

CompSci-61B, Data Structures Final Exam

Your Name: CompSci-61B, Data Structures Final Exam Your 8-digit Student ID: Your CS61B Class Account Login: This is a final test for mastery of the material covered in our labs, lectures, and readings.

2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,

The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge, cheapest first, we had to determine whether its two endpoints

Big Data and Scripting. Part 4: Memory Hierarchies

1, Big Data and Scripting Part 4: Memory Hierarchies 2, Model and Definitions memory size: M machine words total storage (on disk) of N elements (N is very large) disk size unlimited (for our considerations)

CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team

CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team Lecture Summary In this lecture, we learned about the ADT Priority Queue. A

Class Notes CS 3137. 1 Creating and Using a Huffman Code. Ref: Weiss, page 433

Class Notes CS 3137 1 Creating and Using a Huffman Code. Ref: Weiss, page 433 1. FIXED LENGTH CODES: Codes are used to transmit characters over data links. You are probably aware of the ASCII code, a fixed-length

Binary Trees (1) Outline and Required Reading: Binary Trees ( 6.3) Data Structures for Representing Trees ( 6.4)

1 Binary Trees (1) Outline and Required Reading: Binary Trees ( 6.3) Data Structures for Representing Trees ( 6.4) COSC 2011, Fall 2003, Section A Instructor: N. Vlajic Binary Tree 2 Binary Tree tree with

CS 253: Algorithms. Chapter 12. Binary Search Trees. * Deletion and Problems. Credit: Dr. George Bebis

CS 2: Algorithms Chapter Binary Search Trees * Deletion and Problems Credit: Dr. George Bebis Binary Search Trees Tree representation: A linked data structure in which each node is an object Node representation:

ER E P M A S S I CONSTRUCTING A BINARY TREE EFFICIENTLYFROM ITS TRAVERSALS DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A-1998-5

S I N S UN I ER E P S I T VER M A TA S CONSTRUCTING A BINARY TREE EFFICIENTLYFROM ITS TRAVERSALS DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A-1998-5 UNIVERSITY OF TAMPERE DEPARTMENT OF

A Note on Maximum Independent Sets in Rectangle Intersection Graphs

A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,

SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

OPTIMAL BINARY SEARCH TREES

OPTIMAL BINARY SEARCH TREES 1. PREPARATION BEFORE LAB DATA STRUCTURES An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum.

Binary Search Trees. Ric Glassey glassey@kth.se

Binary Search Trees Ric Glassey glassey@kth.se Outline Binary Search Trees Aim: Demonstrate how a BST can maintain order and fast performance relative to its height Properties Operations Min/Max Search

DATA STRUCTURES USING C

DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give

The Tower of Hanoi. Recursion Solution. Recursive Function. Time Complexity. Recursive Thinking. Why Recursion? n! = n* (n-1)!

The Tower of Hanoi Recursion Solution recursion recursion recursion Recursive Thinking: ignore everything but the bottom disk. 1 2 Recursive Function Time Complexity Hanoi (n, src, dest, temp): If (n >

Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

1.204 Lecture 6. Data structures: stacks, queues, trees, dictionaries. Data structures

1.204 Lecture 6 Data structures: stacks, queues, trees, dictionaries Data structures Correct and efficient representation of data and applicable rules Stack: last in, first out discipline Queue: first

Divide and Conquer. Textbook Reading Chapters 4, 7 & 33.4

Divide d Conquer Textook Reading Chapters 4, 7 & 33.4 Overview Design principle Divide d conquer Proof technique Induction, induction, induction Analysis technique Recurrence relations Prolems Sorting

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

Data Structures. Jaehyun Park. CS 97SI Stanford University. June 29, 2015

Data Structures Jaehyun Park CS 97SI Stanford University June 29, 2015 Typical Quarter at Stanford void quarter() { while(true) { // no break :( task x = GetNextTask(tasks); process(x); // new tasks may

S. Muthusundari. Research Scholar, Dept of CSE, Sathyabama University Chennai, India e-mail: nellailath@yahoo.co.in. Dr. R. M.

A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST S. Muthusundari Research Scholar,

PES Institute of Technology-BSC QUESTION BANK

PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions

Data Structure [Question Bank]

Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note: