DOCSLIB.ORG

Balanced Binary Search Trees

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Balanced Binary Search Trees Balanced Binary Search Trees Pedro Ribeiro DCC/FCUP 2019/2020 Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 1 / 48 Motivation Let S be a set of "comparable" objects/items: I Let a and b be two different objects. They are "comparable" if it is possible to say that a < b, a = b or a > b. I Example: numbers, but we could have other data types (students with names and numbers, teams with points and goal-average, :::) A few possible problems of interest: I Given a set S, determine if a certain item is in S I Given a dynamic set S (that changes with insertions and removals), determine if a certain item is in S I Given a dynamic set S, determine the min/max item in S I Given a dynamic set S, determine the elements in a range [a; b] I Sort a set S I ::: Binary Search Trees! Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 2 / 48 Binary Search Trees - Notation An overview of notation for binary trees: Node A is the root and nodes D, E and F are the leafs Nodes fB; D; Eg are a subtree Node A is the parent of nodes B and C Nodes D and E are children of node B Node B is a brother of node C ... Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 3 / 48 Binary Search Trees - Overview For all nodes of tree, the following must hold: the node is bigger than all nodes in the left subtree and smaller than all nodes in the right subtree Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 4 / 48 Binary Search Trees - Example The smallest element is... in the leftmost node The biggest element is... in the rightmost node Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 5 / 48 Binary Search Trees - Search Searching for values in binary search trees: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 6 / 48 Binary Search Trees - Search Searching for values in binary search trees: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 7 / 48 Binary Search Trees - Search Seaching for values in binary search trees: Searching in a binary search tree (true/false to check if exists) Search(T ; v): If Null(T ) then return false Else If v < T :value then return Search(T :left child; v) Else If v > T :value then return Search(T :right child; v) Else return true Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 8 / 48 Binary Search Trees - Insertion Inserting values in binary search trees: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 9 / 48 Binary Search Trees - Insertion Inserting values in binary search trees: Insertion on a binary search tree Insert(T ; v): If Null(T ) then return new Node(v) If v < T :value then T :left child = Insert(T :left child; v) Else If v > T :value then T :right child = Insert(T :right child; v) return T Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 10 / 48 Binary Search Trees - Removal Removing values from binary search trees: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 11 / 48 Binary Search Trees - Removal After finding the node we need to decide how to remove I 3 possible cases: + + + Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 12 / 48 Binary Search Trees - Execution Time How to characterize the execution time of each operation? I All operations search for a node traversing the height of the tree Complexity of operations in a binary search tree Let h be the height of a binary search tree T . The complexity of finding the minimum, maximum, or searching for an element, or inserting or removing an element in T is O(h). Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 13 / 48 Binary Search Trees - Visualization A nice visualization of search, insertion and removal can be seen in: https://www.cs.usfca.edu/~galles/visualization/BST.html Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 14 / 48 Unbalanced Trees The problem of the previous methods: The height of the tree can be of the order of O(n) (where n is the number of elements) Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 15 / 48 Balancing Strategies There are many strategies to guarantee that the complexity of the search, insertion and removal operations are better than O(n) Balanced Trees: Other Data Structures: (height O(log n)) I Skip Lists I AVL Trees I Hash Tables I Red-Black Trees I Bloom Filters I Splay Trees I Treaps Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 16 / 48 Balancing Strategies A simple strategy: reconstruct the tree once in a while ) On a "perfect" binary tree with n nodes, the height is... O(log(n)) Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 17 / 48 Balancing Strategies Given a sorted list of numbers, in which order should we insert them in a binary search tree so that it stays as balanced as possible? Answer: \binary search", insert the element in the middle, split the reamaining list in two (smaller and bigger) based on that element and insert each half applying the same method How frequently should we reconstruct the binary search tree so that we can guarantee efficiency? If we reconstruct often we have many O(n) operations If we rarely reconstruct, the tree may become unbalanced p A possible answer: after O( N) insertions Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 18 / 48 Balancing Strategies Simple case: how to balance the following tree (between parenthesis is the height): ) This operation is called a right rotation Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 19 / 48 Balancing Strategies The relevant rotation operations are the following: I Note that we must not break the properties that turn the tree into a binary search tree Right Rotation ) Left Rotation ) Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 20 / 48 AVL Trees AVL Tree A binary search tree that guarantees that for each node, the heights of the left and right subtrees differ by at most one unit (height invariant) When inserting and removing nodes, we change the tree so that we keep the height invariant Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 21 / 48 AVL Trees Inserting on a AVL tree works like inserting on any binary search tree. However, the tree might break the height invariant (and stop being "balanced") The following cases may occur: +2 on the left +2 on the right Let's see how to correct the first case with simple rotations. Correcting the second case is similar, but with mirrored rotations Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 22 / 48 AVL Trees In the first case, we have two different possible shapes of the AVL Tree The first: ) Left is too "heavy", case 1 We correct by making a right rotation starting in X Note: the height of Y2 might be h + 1 or h: this correction works for both cases Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 23 / 48 AVL Trees The second: ) ) Left is too "heavy", case 2 We correct by making a left rotation starting in Y , followed by a right rotation starting in X Note: the height of Y21 or Y22 might be h or h − 1: this correction works for both cases Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 24 / 48 AVL Trees By inserting nodes we might unbalance the tree (breaking the height invariant) In order to correct this, we apply rotations along the path where the node was inserted There are two analogous unbalancing types: to the left or to the right Each type has two possible cases, that are solved by applying different rotations Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 25 / 48 AVL Trees Example of node insertion: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 26 / 48 AVL Trees Example of node insertion: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 26 / 48 AVL Trees Example of node insertion: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 26 / 48 AVL Trees Example of node insertion: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 26 / 48 AVL Trees Example of node insertion: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 26 / 48 AVL Trees Example of node insertion: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 26 / 48 AVL Trees Example of node insertion: Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 26 / 48 AVL Trees Example of node insertion: (after two rotations) Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 26 / 48 AVL Trees To remove elements, we apply the same idea of insertion First, we find the node to remove We apply one of the modifications seen for binary search trees We apply rotations as described along the path until we reach the root Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 27 / 48 AVL Trees For the search operation, we only traverse the tree height For the insertion operation, we traverse the tree height and the we apply at most two rotations (why only two?), that take O(1) For the removal operation, we traverse the tree height and the we apply at most two rotations over the path until the root We conclude that the complexity of each operation is O(h), where h is the tree height What is the maximum height of an AVL Tree? Pedro Ribeiro (DCC/FCUP) Balanced Binary Search Trees 2019/2020 28 / 48 AVL Trees To calculate the worst case of the tree height, let's do the following exercise: I What is the smallest AVL tree (following the height invariant) with height exactly h? I We will call N(h) to the number of nodes of a tree with height h Pedro Ribeiro (DCC/FCUP) Balanced
Load more

Recommended publications
  • Trees • Binary Trees • Newer Types of Tree Structures • M-Ary Trees
    Data Organization and Processing Hierarchical Indexing (NDBI007) David Hoksza http://siret.ms.mff.cuni.cz/hoksza 1 Outline • Background • prefix tree • graphs • … • search trees • binary trees • Newer types of tree structures • m-ary trees • Typical tree type structures • B-tree • B+-tree • B*-tree 2 Motivation • Similarly as in hashing, the motivation is to find record(s) given a query key using only a few operations • unlike hashing, trees allow to retrieve set of records with keys from given range • Tree structures use “clustering” to efficiently filter out non relevant records from the data set • Tree-based indexes practically implement the index file data organization • for each search key, an indexing structure can be maintained 3 Drawbacks of Index(-Sequential) Organization • Static nature • when inserting a record at the beginning of the file, the whole index needs to be rebuilt • an overflow handling policy can be applied → the performance degrades as the file grows • reorganization can take a lot of time, especially for large tables • not possible for online transactional processing (OLTP) scenarios (as opposed to OLAP – online analytical processing) where many insertions/deletions occur 4 Tree Indexes • Most common dynamic indexing structure for external memory • When inserting/deleting into/from the primary file, the indexing structure(s) residing in the secondary file is modified to accommodate the new key • The modification of a tree is implemented by splitting/merging nodes • Used not only in databases • NTFS directory structure
    [Show full text]
  • Balanced Trees Part One
    Balanced Trees Part One Balanced Trees ● Balanced search trees are among the most useful and versatile data structures. ● Many programming languages ship with a balanced tree library. ● C++: std::map / std::set ● Java: TreeMap / TreeSet ● Many advanced data structures are layered on top of balanced trees. ● We’ll see several later in the quarter! Where We're Going ● B-Trees (Today) ● A simple type of balanced tree developed for block storage. ● Red/Black Trees (Today/Thursday) ● The canonical balanced binary search tree. ● Augmented Search Trees (Thursday) ● Adding extra information to balanced trees to supercharge the data structure. Outline for Today ● BST Review ● Refresher on basic BST concepts and runtimes. ● Overview of Red/Black Trees ● What we're building toward. ● B-Trees and 2-3-4 Trees ● Simple balanced trees, in depth. ● Intuiting Red/Black Trees ● A much better feel for red/black trees. A Quick BST Review Binary Search Trees ● A binary search tree is a binary tree with 9 the following properties: 5 13 ● Each node in the BST stores a key, and 1 6 10 14 optionally, some auxiliary information. 3 7 11 15 ● The key of every node in a BST is strictly greater than all keys 2 4 8 12 to its left and strictly smaller than all keys to its right. Binary Search Trees ● The height of a binary search tree is the 9 length of the longest path from the root to a 5 13 leaf, measured in the number of edges. 1 6 10 14 ● A tree with one node has height 0.
    [Show full text]
  • Assignment 3: Kdtree ______Due June 4, 11:59 PM
    CS106L Handout #04 Spring 2014 May 15, 2014 Assignment 3: KDTree _________________________________________________________________________________________________________ Due June 4, 11:59 PM Over the past seven weeks, we've explored a wide array of STL container classes. You've seen the linear vector and deque, along with the associative map and set. One property common to all these containers is that they are exact. An element is either in a set or it isn't. A value either ap- pears at a particular position in a vector or it does not. For most applications, this is exactly what we want. However, in some cases we may be interested not in the question “is X in this container,” but rather “what value in the container is X most similar to?” Queries of this sort often arise in data mining, machine learning, and computational geometry. In this assignment, you will implement a special data structure called a kd-tree (short for “k-dimensional tree”) that efficiently supports this operation. At a high level, a kd-tree is a generalization of a binary search tree that stores points in k-dimen- sional space. That is, you could use a kd-tree to store a collection of points in the Cartesian plane, in three-dimensional space, etc. You could also use a kd-tree to store biometric data, for example, by representing the data as an ordered tuple, perhaps (height, weight, blood pressure, cholesterol). However, a kd-tree cannot be used to store collections of other data types, such as strings. Also note that while it's possible to build a kd-tree to hold data of any dimension, all of the data stored in a kd-tree must have the same dimension.
    [Show full text]
  • Splay Trees Last Changed: January 28, 2017
    15-451/651: Design & Analysis of Algorithms January 26, 2017 Lecture #4: Splay Trees last changed: January 28, 2017 In today's lecture, we will discuss: • binary search trees in general • definition of splay trees • analysis of splay trees The analysis of splay trees uses the potential function approach we discussed in the previous lecture. It seems to be required. 1 Binary Search Trees These lecture notes assume that you have seen binary search trees (BSTs) before. They do not contain much expository or backtround material on the basics of BSTs. Binary search trees is a class of data structures where: 1. Each node stores a piece of data 2. Each node has two pointers to two other binary search trees 3. The overall structure of the pointers is a tree (there's a root, it's acyclic, and every node is reachable from the root.) Binary search trees are a way to store and update a set of items, where there is an ordering on the items. I know this is rather vague. But there is not a precise way to define the gamut of applications of search trees. In general, there are two classes of applications. Those where each item has a key value from a totally ordered universe, and those where the tree is used as an efficient way to represent an ordered list of items. Some applications of binary search trees: • Storing a set of names, and being able to lookup based on a prefix of the name. (Used in internet routers.) • Storing a path in a graph, and being able to reverse any subsection of the path in O(log n) time.
    [Show full text]
  • Search Trees for Strings a Balanced Binary Search Tree Is a Powerful Data Structure That Stores a Set of Objects and Supports Many Operations Including
    Search Trees for Strings A balanced binary search tree is a powerful data structure that stores a set of objects and supports many operations including: Insert and Delete. Lookup: Find if a given object is in the set, and if it is, possibly return some data associated with the object. Range query: Find all objects in a given range. The time complexity of the operations for a set of size n is O(log n) (plus the size of the result) assuming constant time comparisons. There are also alternative data structures, particularly if we do not need to support all operations: • A hash table supports operations in constant time but does not support range queries. • An ordered array is simpler, faster and more space efficient in practice, but does not support insertions and deletions. A data structure is called dynamic if it supports insertions and deletions and static if not. 107 When the objects are strings, operations slow down: • Comparison are slower. For example, the average case time complexity is O(log n logσ n) for operations in a binary search tree storing a random set of strings. • Computing a hash function is slower too. For a string set R, there are also new types of queries: Lcp query: What is the length of the longest prefix of the query string S that is also a prefix of some string in R. Prefix query: Find all strings in R that have S as a prefix. The prefix query is a special type of range query. 108 Trie A trie is a rooted tree with the following properties: • Edges are labelled with symbols from an alphabet Σ.
    [Show full text]
  • Trees, Binary Search Trees, Heaps & Applications Dr. Chris Bourke
    Trees Trees, Binary Search Trees, Heaps & Applications Dr. Chris Bourke Department of Computer Science & Engineering University of Nebraska|Lincoln Lincoln, NE 68588, USA [email protected] http://cse.unl.edu/~cbourke 2015/01/31 21:05:31 Abstract These are lecture notes used in CSCE 156 (Computer Science II), CSCE 235 (Dis- crete Structures) and CSCE 310 (Data Structures & Algorithms) at the University of Nebraska|Lincoln. This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License 1 Contents I Trees4 1 Introduction4 2 Definitions & Terminology5 3 Tree Traversal7 3.1 Preorder Traversal................................7 3.2 Inorder Traversal.................................7 3.3 Postorder Traversal................................7 3.4 Breadth-First Search Traversal..........................8 3.5 Implementations & Data Structures.......................8 3.5.1 Preorder Implementations........................8 3.5.2 Inorder Implementation.........................9 3.5.3 Postorder Implementation........................ 10 3.5.4 BFS Implementation........................... 12 3.5.5 Tree Walk Implementations....................... 12 3.6 Operations..................................... 12 4 Binary Search Trees 14 4.1 Basic Operations................................. 15 5 Balanced Binary Search Trees 17 5.1 2-3 Trees...................................... 17 5.2 AVL Trees..................................... 17 5.3 Red-Black Trees.................................. 19 6 Optimal Binary Search Trees 19 7 Heaps 19
    [Show full text]
  • Simple Balanced Binary Search Trees
    Simple Balanced Binary Search Trees Prabhakar Ragde Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, Canada [email protected] Efficient implementations of sets and maps (dictionaries) are important in computer science, and bal- anced binary search trees are the basis of the best practical implementations. Pedagogically, however, they are often quite complicated, especially with respect to deletion. I present complete code (with justification and analysis not previously available in the literature) for a purely-functional implemen- tation based on AA trees, which is the simplest treatment of the subject of which I am aware. 1 Introduction Trees are a fundamental data structure, introduced early in most computer science curricula. They are easily motivated by the need to store data that is naturally tree-structured (family trees, structured doc- uments, arithmetic expressions, and programs). We also expose students to the idea that we can impose tree structure on data that is not naturally so, in order to implement efficient manipulation algorithms. The typical first example is the binary search tree. However, they are problematic. Naive insertion and deletion are easy to present in a first course using a functional language (usually the topic is delayed to a second course if an imperative language is used), but in the worst case, this im- plementation degenerates to a list, with linear running time for all operations. The solution is to balance the tree during operations, so that a tree with n nodes has height O(logn). There are many different ways of doing this, but most are too complicated to present this early in the curriculum, so they are usually deferred to a later course on algorithms and data structures, leaving a frustrating gap.
    [Show full text]
  • Balanced Binary Search Trees – AVL Trees, 2-3 Trees, B-Trees
    Balanced binary search trees – AVL trees, 2‐3 trees, B‐trees Professor Clark F. Olson (with edits by Carol Zander) AVL trees One potential problem with an ordinary binary search tree is that it can have a height that is O(n), where n is the number of items stored in the tree. This occurs when the items are inserted in (nearly) sorted order. We can fix this problem if we can enforce that the tree remains balanced while still inserting and deleting items in O(log n) time. The first (and simplest) data structure to be discovered for which this could be achieved is the AVL tree, which is names after the two Russians who discovered them, Georgy Adelson‐Velskii and Yevgeniy Landis. It takes longer (on average) to insert and delete in an AVL tree, since the tree must remain balanced, but it is faster (on average) to retrieve. An AVL tree must have the following properties: • It is a binary search tree. • For each node in the tree, the height of the left subtree and the height of the right subtree differ by at most one (the balance property). The height of each node is stored in the node to facilitate determining whether this is the case. The height of an AVL tree is logarithmic in the number of nodes. This allows insert/delete/retrieve to all be performed in O(log n) time. Here is an example of an AVL tree: 18 3 37 2 11 25 40 1 8 13 42 6 10 15 Inserting 0 or 5 or 16 or 43 would result in an unbalanced tree.
    [Show full text]
  • Binary Heaps
    Binary Heaps COL 106 Shweta Agrawal and Amit Kumar Revisiting FindMin • Application: Find the smallest ( or highest priority) item quickly – Operating system needs to schedule jobs according to priority instead of FIFO – Event simulation (bank customers arriving and departing, ordered according to when the event happened) – Find student with highest grade, employee with highest salary etc. 2 Priority Queue ADT • Priority Queue can efficiently do: – FindMin (and DeleteMin) – Insert • What if we use… – Lists: If sorted, what is the run time for Insert and FindMin? Unsorted? – Binary Search Trees: What is the run time for Insert and FindMin? – Hash Tables: What is the run time for Insert and FindMin? 3 Less flexibility More speed • Lists – If sorted: FindMin is O(1) but Insert is O(N) – If not sorted: Insert is O(1) but FindMin is O(N) • Balanced Binary Search Trees (BSTs) – Insert is O(log N) and FindMin is O(log N) • Hash Tables – Insert O(1) but no hope for FindMin • BSTs look good but… – BSTs are efficient for all Finds, not just FindMin – We only need FindMin 4 Better than a speeding BST • We can do better than Balanced Binary Search Trees? – Very limited requirements: Insert, FindMin, DeleteMin. The goals are: – FindMin is O(1) – Insert is O(log N) – DeleteMin is O(log N) 5 Binary Heaps • A binary heap is a binary tree (NOT a BST) that is: – Complete: the tree is completely filled except possibly the bottom level, which is filled from left to right – Satisfies the heap order property • every node is less than or equal to its children
    [Show full text]
  • B-Trees and 2-3-4 Trees Reading
    B-Trees and 2-3-4 Trees Reading: • B-Trees 18 CLRS • Multi-Way Search Trees 3.3.1 and (2,4) Trees 3.3.2 GT B-trees are an extension of binary search trees: • They store more than one key at a node to divide the range of its subtree's keys into more than two subranges. 2, 7 • Every internal node has between t and 2t children. Every internal node has one more child than key. • 1, 0 3, 6 8, 9, 11 • All of the leaves must be at same level. − We will see shortly that the last two properties keep the tree balanced. Most binary search tree algorithms can easily be converted to B-trees. The amount of work done at each node increases with t (e.g. determining which branch to follow when searching for a key), but the height of the tree decreases with t, so less nodes are visited. Databases use high values of t to minimize I/O overhead: Reading each tree node requires a slow random disk access, so high branching factors reduce the number of such accesses. We will assume a low branching factor of t = 2 because our focus is on balanced data structures. But the ideas we present apply to higher branching factors. Such B-trees are often called 2-3-4 trees because their branching factor is always 2, 3, or 4. To guarantee a branching factor of 2 to 4, each internal node must store 1 to 3 keys. As with binary trees, we assume that the data associated with the key is stored with the key in the node.
    [Show full text]
  • 2-3-4 Trees and Red- Black Trees
    CS 16: Balanced Trees 2-3-4 Trees and Red- Black Trees erm 204 CS 16: Balanced Trees 2-3-4 Trees Revealed • Nodes store 1, 2, or 3 keys and have 2, 3, or 4 children, respectively • All leaves have the same depth k b e h nn rr a c d f g i l m p s x 1 ---log()N + 1 ≤≤height log()N + 1 2 erm 205 CS 16: Balanced Trees 2-3-4 Tree Nodes • Introduction of nodes with more than 1 key, and more than 2 children 2-node: a • same as a binary node <a >a a b 3-node: • 2 keys, 3 links <a >b >a <b 4-node: a b c • 3 keys, 4 links <a >c >a >b <b <c erm 206 CS 16: Balanced Trees Why 2-3-4? • Why not minimize height by maximizing children in a “d-tree”? • Let each node have d children so that we get O(logd N) search time! Right? log d N = log N/log d • That means if d = N1/2, we get a height of 2 • However, searching out the correct child on each level requires O(log N1/2) by binary search • 2 log N1/2 = O(log N) which is not as good as we had hoped for! • 2-3-4-trees will guarantee O(log N) height using only 2, 3, or 4 children per node erm 207 CS 16: Balanced Trees Insertion into 2-3-4 Trees • Insert the new key at the lowest internal node reached in the search • 2-node becomes 3-node g d d g • 3-node becomes 4-node f d g d f g • What about a 4-node? • We can’t insert another key! erm 208 CS 16: Balanced Trees Top Down Insertion • In our way down the tree, whenever we reach a 4-node, we break it up into two 2- nodes, and move the middle element up into the parent node e e n f n d f g d g • Now we can perform the insertion using one of the f n previous two cases • Since we follow this method from the root down d e g to the leaf, it is called top down insertion erm 209 CS 16: Balanced Trees Splitting the Tree As we travel down the tree, if we encounter any 4-node we will break it up into 2-nodes.
    [Show full text]
  • Slides-Data-Structures.Pdf
    Data structures ● Organize your data to support various queries using little time an space Example: Inventory Want to support SEARCH INSERT DELETE ● Given n elements A[1..n] ● Support SEARCH(A,x) := is x in A? ● Trivial solution: scan A. Takes time Θ(n) ● Best possible given A, x. ● What if we are first given A, are allowed to preprocess it, can we then answer SEARCH queries faster? ● How would you preprocess A? ● Given n elements A[1..n] ● Support SEARCH(A,x) := is x in A? ● Preprocess step: Sort A. Takes time O(n log n), Space O(n) ● SEARCH(A[1..n],x) := /* Binary search */ If n = 1 then return YES if A[1] = x, and NO otherwise else if A[n/2] ≤ x then return SEARCH(A[n/2..n]) else return SEARCH(A[1..n/2]) ● Time T(n) = ? ● Given n elements A[1..n] ● Support SEARCH(A,x) := is x in A? ● Preprocess step: Sort A. Takes time O(n log n), Space O(n) ● SEARCH(A[1..n],x) := /* Binary search */ If n = 1 then return YES if A[1] = x, and NO otherwise else if A[n/2] ≤ x then return SEARCH(A[n/2..n]) else return SEARCH(A[1..n/2]) ● Time T(n) = O(log n). ● Given n elements A[1..n] each ≤ k, can you do faster? ● Support SEARCH(A,x) := is x in A? ● DIRECTADDRESS: Initialize S[1..k] to 0 ● Preprocess step: For (i = 1 to n) S[A[i]] = 1 ● T(n) = O(n), Space O(k) ● SEARCH(A,x) = ? ● Given n elements A[1..n] each ≤ k, can you do faster? ● Support SEARCH(A,x) := is x in A? ● DIRECTADDRESS: Initialize S[1..k] to 0 ● Preprocess step: For (i = 1 to n) S[A[i]] = 1 ● T(n) = O(n), Space O(k) ● SEARCH(A,x) = return S[x] ● T(n) = O(1) ● Dynamic problems: ● Want to support SEARCH, INSERT, DELETE ● Support SEARCH(A,x) := is x in A? ● If numbers are small, ≤ k Preprocess: Initialize S to 0.
    [Show full text]