A tree is a simple graph satisfying: if v and w are vertices and there is a path from v to w, it is a unique simple path. a b c a b c.

Slides:

Advertisements

Similar presentations

Andreas Savva Data Structures Chapter 5 Recursion.

Advertisements

Trees Chapter 11.

Chapter 10: Trees. Definition A tree is a connected undirected acyclic (with no cycle) simple graph A collection of trees is called forest.

CMPS 2433 Discrete Structures Chapter 5 - Trees R. HALVERSON – MIDWESTERN STATE UNIVERSITY.

Binary Trees, Binary Search Trees CMPS 2133 Spring 2008.

1 Chapter 10 Trees. Tree Definition 1. A tree is a connected undirected graph with no simple circuits. Theorem 1. An undirected graph is a tree if and.

1 Section 9.1 Introduction to Trees. 2 Tree terminology Tree: a connected, undirected graph that contains no simple circuits –must be a simple graph:

Discrete Mathematics – CIS166

Discrete Mathematics Transparency No. 8-1 Chapter 8 Trees.

Section 3.1 Properties of Trees Sarah Graham. Tree Talk: Vocabulary oTree: a tree is a special type of graph that contains designated vertex called a.

Lists A list is a finite, ordered sequence of data items. Two Implementations –Arrays –Linked Lists.

Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.

Rooted Trees. More definitions parent of d child of c sibling of d ancestor of d descendants of g leaf internal vertex subtree root.

03/01/2005Tucker, Sec Applied Combinatorics, 4th Ed. Alan Tucker Section 3.1 Properties of Trees Prepared by Joshua Schoenly and Kathleen McNamara.

CSC 2300 Data Structures & Algorithms February 6, 2007 Chapter 4. Trees.

Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.

KNURE, Software department, Ph , N.V. Bilous Faculty of computer sciences Software department, KNURE The trees.

Trees and Tree Traversals Prof. Sin-Min Lee Department of Computer Science San Jose State University.

12-CRS-0106 REVISED 8 FEB 2013 CSG2A3 ALGORITMA dan STRUKTUR DATA.

May 1, 2002Applied Discrete Mathematics Week 13: Graphs and Trees 1News CSEMS Scholarships for CS and Math students (US citizens only) $3,125 per year.

Week 11 - Wednesday.  What did we talk about last time?  Graphs  Euler paths and tours.

Tree A connected graph that contains no simple circuits is called a tree. Because a tree cannot have a simple circuit, a tree cannot contain multiple.

Lecture 17 Trees CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

Copyright © Cengage Learning. All rights reserved. CHAPTER 10 GRAPHS AND TREES.

Discrete Structures Lecture 12: Trees Ji Yanyan United International College Thanks to Professor Michael Hvidsten.

5.5.2 M inimum spanning trees  Definition 24: A minimum spanning tree in a connected weighted graph is a spanning tree that has the smallest possible.

5.5.3 Rooted tree and binary tree  Definition 25: A directed graph is a directed tree if the graph is a tree in the underlying undirected graph.  Definition.

Data Structures TREES.

Discrete Structures Trees (Ch. 11)

Agenda Review: –Planar Graphs Lecture Content:  Concepts of Trees  Spanning Trees  Binary Trees Exercise.

5.5.2 M inimum spanning trees  Definition 24: A minimum spanning tree in a connected weighted graph is a spanning tree that has the smallest possible.

Trees : Part 1 Section 4.1 (1) Theory and Terminology (2) Preorder, Postorder and Levelorder Traversals.

Min Chen School of Computer Science and Engineering Seoul National University Data Structure: Chapter 6.

Trees By P.Naga Srinivasu M.tech,(MBA). Basic Tree Concepts A tree consists of finite set of elements, called nodes, and a finite set of directed lines.

Discrete Mathematics Chapter 5 Trees.

1 Slides by Sylvia Sorkin, Community College of Baltimore County - Essex Campus Trees.

Trees Dr. Yasir Ali. A graph is called a tree if, and only if, it is circuit-free and connected. A graph is called a forest if, and only if, it is circuit-free.

Chapter 10: Trees A tree is a connected simple undirected graph with no simple circuits. Properties: There is a unique simple path between any 2 of its.

Data Structures Lakshmish Ramaswamy. Tree Hierarchical data structure Several real-world systems have hierarchical concepts –Physical and biological systems.

CHAPTER 11 TREES INTRODUCTION TO TREES ► A tree is a connected undirected graph with no simple circuit. ► An undirected graph is a tree if and only.

Discrete Structures – CNS 2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 9 Trees.

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Tree - in “math speak” An ________ graph is a set of vertices/nodes and a set of edges, each edge connects two vertices. Any undirected graph in which.

Chapter 6 – Trees. Notice that in a tree, there is exactly one path from the root to each node.

1 Trees : Part 1 Reading: Section 4.1 Theory and Terminology Preorder, Postorder and Levelorder Traversals.

Trees A non-linear implementation for collection classes.

Tree Representation and Terminology Binary Trees Binary Search Trees Pointer-Based Representation of a Binary Tree Array-Based Representation of a Binary.

Code: BCA302 Data Structures with C Prof. (Dr.) Monalisa Banerjee By.

Section10.1: Introduction to Trees

Applied Discrete Mathematics Week 15: Trees

Graph Graphs and graph theory can be used to model:

Discrete Mathematicsq

Source Code for Data Structures and Algorithm Analysis in C (Second Edition) – by Weiss

12. Graphs and Trees 2 Summary

Introduction to Trees Section 11.1.

CHAPTER 4 Trees.

Advanced Algorithms Analysis and Design

Binary Trees, Binary Search Trees

CS223 Advanced Data Structures and Algorithms

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 10 Trees Slides are adopted from “Discrete.

Discrete Mathematics – CIS166

Lecture 36 Section 12.2 Mon, Apr 23, 2007

Discrete Mathematics – CIS166

Trees 11.1 Introduction to Trees Dr. Halimah Alshehri.

And the Final Subject is…

Presentation transcript:

A tree is a simple graph satisfying: if v and w are vertices and there is a path from v to w, it is a unique simple path. a b c a b c

c b a d e f i j hg Designate ‘a’ the root What other node could have been chosen the root? b Then the tree would look: b d e f a i j hg

c b a d e f i j hg Terms: Root level = 0 Level 1b,g,h,c Level 2d,e,f,i,j Height of tree:Maximum level in tree Level of a vertex: Length of the simple path from root to vertex.

Parentv n-1 Siblings: nodes (vertices) with the same parent c b a d e f i j hg More terms: of v n : Ancestors: All nodes in the path from the root to the node, except the node itself. Terminal vertex (leaf):A node with no children. Internal vertex (branch vertex):Not a leaf. Subtree of T rooted at x: The graph consisting of x and its descendants and all edges on a path from x to each descendant.

b d e f a i j hg A tree is connected. A tree does not contain a cycle. A tree with n vertices has n-1 edges. (by direct proof) (indirect proof) (mathematical induction)