Presentation is loading. Please wait.

Presentation is loading. Please wait.

Data Structure II. Outline Heap Binary Search Tree Hash Table Binary Indexed Tree Segment Tree.

Published byEustace Bishop Modified over 8 years ago

Similar presentations

Presentation on theme: "Data Structure II. Outline Heap Binary Search Tree Hash Table Binary Indexed Tree Segment Tree."— Presentation transcript:

1 Data Structure II

2 Outline Heap Binary Search Tree Hash Table Binary Indexed Tree Segment Tree

3 Heap A left-complete binary tree which has every node greater than its two children, if any of them exists Insert Extract-max Heapify Make-heap

4 Binary Search Tree A binary tree which exhibits the following properties ◦Root > all elements in left subtree ◦Root <= all elements in right subtree Search ◦Most convenient if written recursively Insert – a bit trivial Delete ◦0 children, 1 child, 2 children Balance Tree ◦AVL tree, Red-Black Tree

5 Hash Table “Dictionary” Search – O(1) Insert – O(1) Delete – O(1) Collision? Hash function Close Addressing ◦Chaining Open Addressing

6 Binary Indexed Tree Peter Fenwick http://eprints.kfupm.edu.sa/19492/1/194 92.pdf

7 Segment Tree http://ttts.tust.edu.cn/UpFile/UpAttachme nt/2008-5/20085292039.doc http://ttts.tust.edu.cn/UpFile/UpAttachme nt/2008-5/20085292039.doc

8 Thank you! Dinner Time…

Download ppt "Data Structure II. Outline Heap Binary Search Tree Hash Table Binary Indexed Tree Segment Tree."

Similar presentations

Chapter 10: Data Structures II

Chapter 10: Data Structures II
Interval Heaps Complete binary tree. Each node (except possibly last one) has 2 elements. Last node has 1 or 2 elements. Let a and b be the elements in.

Interval Heaps Complete binary tree. Each node (except possibly last one) has 2 elements. Last node has 1 or 2 elements. Let a and b be the elements in.
The Dictionary ADT Definition A dictionary is an ordered or unordered list of key-element pairs, where keys are used to locate elements in the list. Example:

The Dictionary ADT Definition A dictionary is an ordered or unordered list of key-element pairs, where keys are used to locate elements in the list. Example:
Transform and Conquer Chapter 6. Transform and Conquer Solve problem by transforming into: a more convenient instance of the same problem (instance simplification)

Transform and Conquer Chapter 6. Transform and Conquer Solve problem by transforming into: a more convenient instance of the same problem (instance simplification)
Trees Types and Operations

Trees Types and Operations
AVL Tree Smt Genap 2011-2012. Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap 2011-2012.

AVL Tree Smt Genap Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap
Data Abstraction and Problem Solving with JAVA Walls and Mirrors Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley Data Abstraction and Problem.

Data Abstraction and Problem Solving with JAVA Walls and Mirrors Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley Data Abstraction and Problem.
AVL Trees Balanced Trees. AVL Tree Property A Binary search tree is an AVL tree if : –the height of the left subtree and the height of the right subtree.

AVL Trees Balanced Trees. AVL Tree Property A Binary search tree is an AVL tree if : –the height of the left subtree and the height of the right subtree.
Binary Search Trees Dictionary Operations:  IsEmpty()  Search(key)  Insert(key, value)  Delete(key)

Binary Search Trees Dictionary Operations:  IsEmpty()  Search(key)  Insert(key, value)  Delete(key)
Self-Balancing Search Trees Chapter 11. Chapter 11: Self-Balancing Search Trees2 Chapter Objectives To understand the impact that balance has on the performance.

Self-Balancing Search Trees Chapter 11. Chapter 11: Self-Balancing Search Trees2 Chapter Objectives To understand the impact that balance has on the performance.
Self-Balancing Search Trees Chapter 11. Chapter Objectives  To understand the impact that balance has on the performance of binary search trees  To.

Self-Balancing Search Trees Chapter 11. Chapter Objectives  To understand the impact that balance has on the performance of binary search trees  To.
AVL trees. AVL Trees We have seen that all operations depend on the depth of the tree. We don’t want trees with nodes which have large height This can.

AVL trees. AVL Trees We have seen that all operations depend on the depth of the tree. We don’t want trees with nodes which have large height This can.
1 Section 9.2 Tree Applications. 2 Binary Search Trees Goal is implementation of an efficient searching algorithm Binary Search Tree: –binary tree in.

1 Section 9.2 Tree Applications. 2 Binary Search Trees Goal is implementation of an efficient searching algorithm Binary Search Tree: –binary tree in.
Types of Binary Trees Introduction. Types of Binary Trees There are several types of binary trees possible each with its own properties. Few important.

Types of Binary Trees Introduction. Types of Binary Trees There are several types of binary trees possible each with its own properties. Few important.
Brought to you by Max (ICQ:31252512 TEL:61337706) February 5, 2005 Advanced Data Structures Introduction.

Brought to you by Max (ICQ: TEL: ) February 5, 2005 Advanced Data Structures Introduction.
AVL Trees Neil Ghani University of Strathclyde. General Trees Recall a tree is * A leaf storing an integer * A node storing a left subtree, an integer.

AVL Trees Neil Ghani University of Strathclyde. General Trees Recall a tree is * A leaf storing an integer * A node storing a left subtree, an integer.
Data Structure & Algorithm II.  Delete-min  Building a heap in O(n) time  Heap Sort.

Data Structure & Algorithm II.  Delete-min  Building a heap in O(n) time  Heap Sort.
Balanced Binary Search Tree 황승원 Fall 2010 CSE, POSTECH.

Balanced Binary Search Tree 황승원 Fall 2010 CSE, POSTECH.
Advanced Data Structure Hackson Leung 2009-01-10.

Advanced Data Structure Hackson Leung
Binary Search Tree 황승원 Fall 2011 CSE, POSTECH 2 2 Search Trees Search trees are ideal for implementing dictionaries – Similar or better performance than.

Binary Search Tree 황승원 Fall 2011 CSE, POSTECH 2 2 Search Trees Search trees are ideal for implementing dictionaries – Similar or better performance than.

Similar presentations

Ads by Google