Trees v w a AlbertRMeyer, April8,2013 AlbertRMeyer, - PowerPoint PPT Presentation

Feb 21, 2024 •146 likes •215 views

Cycles in simple graphs Mathematics for Computer Science MIT 6.042J/18.062J Acycleisaclosedwalk oflength > 2thatdoesnt crossitself: Trees v w a AlbertRMeyer, April8,2013 AlbertRMeyer, April8,2013 tree-def.1

Cycles in simple graphs Mathematics for Computer Science MIT 6.042J/18.062J A cycle is a closed walk of length > 2 that doesn’t cross itself: Trees v w a Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.1 tree-def.2 Cycles in simple graphs Trees length > 2 implies that A tree is a connected graph going back & forth over with no cycles. an edge is not a cycle w v Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.3 tree-def.4 1
Come up all the time More Trees • family trees • search trees • game trees • parse trees • spanning trees Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.5 tree-def.6 Lots of kinds Focus on “pure” trees • rooted unordered, • ordered unrooted, • binary undirected • complete • directed Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.7 tree-def.9 2
Cut Edges Cut Edges An edge is a cut edge if removing it from the graph disconnects two vertices. Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.10 tree-def.11 Cut Edges Cut Edges e deleting e gives e is a cut edge two components Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.12 tree-def.13 3
Cut Edges Cut Edges f still connected with f is not a cut edge edge f deleted Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.14 tree-def.15 Cut Edges Cut Edges and Cycles So a connected graph is Lemma: An edge is a 2-edge connected iff not a cut edge iff it is on a cycle. it has no cut edge. Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.16 tree-def.17 4
alternative tree definition alternative tree definition A tree is a connected graph A tree is a connected graph with every edge a cut edge. that is edge-minimal. equivalently equivalently Albert R Meyer, April 8, 2013 Albert R Meyer, April 8, 2013 tree-def.18 tree-def.19 more equivalent definitions • connected graph with n vertices and n–1 edges • an edge-maximal acyclic graph • graph with a unique path between any 2 vertices Albert R Meyer, April 8, 2013 tree-def.22 5
MIT OpenCourseWare http://ocw.mit.edu 6.042J / 18.062J Mathematics for Computer Science Spring 20 15 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees

B- B -Trees Trees B B- -Trees Trees Search for key R ( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees Trees Each Disk-Read or Disk-Write = one Basic unit of work O(1) Typical Node x

287 views • 4 slides

/ + - * * 5 3 2 6 5 2 Examples Binary Trees BSTs Augmenting BinExpr General Trees

Trees Readings: HtDP , sections 14, 15, 16. Topics: Introductory examples and terminology Binary trees Binary search trees Augmenting trees Binary expression trees General arithmetic expression trees Nested lists Examples Binary Trees

1.19k views • 31 slides

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees,

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees, binary search trees, and AVL and B-Trees. 2 Trees Trees are recursive data structures. They are useful for: representing items that have a tree

622 views • 27 slides

2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes

CS 16: Balanced Trees 2-3-4 Trees and Red- Black Trees 204 erm 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 n r b e h n r b e

800 views • 31 slides

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees)

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees) Albert-Ludwigs-Universitt Freiburg Prof. Dr. Rolf Backofen Bioinformatics Group / Department of Computer Science Algorithms and Data Structures, January

884 views • 55 slides

AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees

AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees AVL trees S. Prasitjutrakul 1994 AVL Trees : I nsertion m m k k k u u k k m m v t u m m t t u k m u k u p v t k p v v

320 views • 16 slides

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees Anatomy of a Tree a In CS, we look at trees Node from the bottom up Basic element of the tree b c Contains a piece of

321 views • 5 slides

Trees Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck

Trees Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck http://cseweb.ucsd.edu/classes/sp16/cse21-bd/ April 29, 2016 Another Special Type of Graph: Trees Trees 1. Definitions of trees 2. Properties of trees 3. Revisiting uses of

837 views • 37 slides

Trees a tree represents a hierarchy - organization structure of a corporation Electronics

T REES trees binary trees traversals of trees template method pattern data structures for trees Trees 1 Trees a tree represents a hierarchy - organization structure of a corporation Electronics RUs R&D

434 views • 18 slides

Trees Applied Multivariate Statistics Spring 2012 Overview Intuition for Trees

Trees Applied Multivariate Statistics Spring 2012 Overview Intuition for Trees Regression Trees Classification Trees 1 Idea of Trees: Regression Trees Continuous response Binary Tree y Y=1.2 X 1 X>1 Y=1.4 Y=0.7 2 X

767 views • 17 slides

Red/Black Trees Mark Redekopp David Kempe 2 An example of B-Trees 2-3 TREES 3 Definition

1 CSCI 104 B-Trees (2-3, 2-3-4) and Red/Black Trees Mark Redekopp David Kempe 2 An example of B-Trees 2-3 TREES 3 Definition 2-3 Tree is a tree where a 2 Node 4 Non-leaf nodes have 1 value & 2 children or 2 values and 3

998 views • 75 slides

Splay Trees and B-Trees CSE 373 Data Structures Lecture 9 Readings Reading Sections

Splay Trees and B-Trees CSE 373 Data Structures Lecture 9 Readings Reading Sections 4.5-4.7 4/14/03 Splay Trees and B-Trees - 2 Lecture 9 Self adjusting Trees Ordinary binary search trees have no balance conditions what

371 views • 33 slides

A Datatype for Binary Trees Functions on Trees Amtoft from Hatcliff Binary Trees One of many

A Datatype for Binary Trees Functions on Trees Amtoft from Hatcliff Binary Trees One of many possible definitions (no interior values) Examples General Trees datatype b i t r e e = Leaf i n t of | Node of b i t r e e b i t r e e

536 views • 8 slides

Visualizing Networks and Trees Arrange Networks and Trees

Visualizing Networks and Trees Arrange Networks and Trees Node-Link Diagrams for Trees The most common visual representa>on Nodes: point marks;

519 views • 15 slides

The number of spanning trees of random 2 -trees Stephan Wagner (joint work with Elmar Teufl)

The number of spanning trees of random 2 -trees Stephan Wagner (joint work with Elmar Teufl) Stellenbosch University AofA15 Strobl, 8 June, 2015 2 -trees 2 -trees are constructed recursively: Spanning trees of 2 -trees S. Wagner,

822 views • 61 slides

Trees Chapter 11 Chapter Summary Introduction to Trees Applications of Trees Tree

Trees Chapter 11 Chapter Summary Introduction to Trees Applications of Trees Tree Traversal Spanning Trees Minimum Spanning Trees Introduction to Trees Section 11.1 Section Summary Introduction to Trees Rooted Trees

639 views • 42 slides

What can we learn from natural and artificial dependency trees ? Marine Courtin, LPP (CNRS) -

What can we learn from natural and artificial dependency trees ? Marine Courtin, LPP (CNRS) - Paris 3 Sorbonne Nouvelle Chunxiao Yan, Modyco (CNRS) - Universit Paris Nanterre Summary Introduce several procedures for generating random

606 views • 23 slides

Priority queue Binary heap March 06, 2019 Cinda Heeren / Will Evans / Geoffrey Tien 1 REMINDER

Priority queue Binary heap March 06, 2019 Cinda Heeren / Will Evans / Geoffrey Tien 1 REMINDER Section 201 midterm is in WOOD 2 19:00 21:00 March 06, 2019 Cinda Heeren / Will Evans / Geoffrey Tien 2 Priority queues?

338 views • 23 slides

1 Fib- -Heap Heap- -Extract Extract- -Min Min Example: Fib- -Heap Heap- -Extract

Fibonacci Heaps Example: Fibonacci Heap Fibonacci Heaps Example: Fibonacci Heap Unordered Binomial trees Unordered Binomial trees Properties of UnorderedBinomial Properties of UnorderedBinomial Trees Trees Lemma. For the unorder

180 views • 3 slides

For Thursday Read Weiss, chapter 4, sections 1-4 Homework: Weiss, chapter 3, exercises

For Thursday Read Weiss, chapter 4, sections 1-4 Homework: Weiss, chapter 3, exercises 4-5 Use the C++ STL list class (and iterators). I only want to see the required functions. Note that you are returning lists without

335 views • 22 slides

Modulo Counting on Words and Trees (joint work with Witold Charatonik) Bartosz Bednarczyk

Modulo Counting on Words and Trees (joint work with Witold Charatonik) Bartosz Bednarczyk bartosz.bednarczyk@ens-paris-saclay.fr Ecole normale sup erieure Paris-Saclay and University of Wrocaw FSTTCS 2017 Kanpur, December 13, 2017

1.11k views • 76 slides

Regression trees DAAG Chapter 11 Learning objectives In this section, we will learn about

Regression trees DAAG Chapter 11 Learning objectives In this section, we will learn about regression trees. What is a regression tree? What types of problems can be addressed with regression trees? How complex a tree? Choosing

183 views • 14 slides

What do graphs have that trees dont? After this lesson, you should be able to define

Review Re A E C F B D What do graphs have that trees dont? After this lesson, you should be able to define the major terminology relating to graphs implement a graph in code, using various conventions https ://

699 views • 23 slides

Deciding the First-Order Theory of an Algebra of Feature Trees with Updates Nicolas Jeannerod

Deciding the First-Order Theory of an Algebra of Feature Trees with Updates Nicolas Jeannerod Ralf Treinen IJCAR18 July 16, 2018 1/20 Features Trees Unranked unordered trees. d d g f g f i i h d d d d d d d g f

225 views • 20 slides