Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 145 views

    Trees PDF

    Uploaded by

    kgiyer
    The document summarizes key concepts about trees: 1. A tree is a connected graph without cycles. There is exactly one path between any two nodes. Removing an edge disconnects the tree but adding an edge creates a cycle. 2. The minimum spanning tree of a graph is a spanning subgraph that is a tree and has the minimum sum of edge weights. Kruskal's algorithm finds a minimum spanning tree. 3. A rooted tree has one root node with indegree 0 and all other nodes have indegree 1. Level refers to distance from the root. Binary and m-ary trees restrict the number of children per node.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Trees PDF

    Uploaded by

    kgiyer
    145 views22 pages
    The document summarizes key concepts about trees: 1. A tree is a connected graph without cycles. There is exactly one path between any two nodes. Removing an edge disconnects the tree but adding an edge creates a cycle. 2. The minimum spanning tree of a graph is a spanning subgraph that is a tree and has the minimum sum of edge weights. Kruskal's algorithm finds a minimum spanning tree. 3. A rooted tree has one root node with indegree 0 and all other nodes have indegree 1. Level refers to distance from the root. Binary and m-ary trees restrict the number of children per node.

    Original Title

    trees.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document summarizes key concepts about trees: 1. A tree is a connected graph without cycles. There is exactly one path between any two nodes. Removing an edge disconnects the tree but adding an edge creates a cycle. 2. The minimum spanning tree of a graph is a spanning subgraph that is a tree and has the minimum sum of edge weights. Kruskal's algorithm finds a minimum spanning tree. 3. A rooted tree has one root node with indegree 0 and all other nodes have indegree 1. Level refers to distance from the root. Binary and m-ary trees restrict the number of children per node.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    145 views22 pages

    Trees PDF

    Uploaded by

    kgiyer
    The document summarizes key concepts about trees: 1. A tree is a connected graph without cycles. There is exactly one path between any two nodes. Removing an edge disconnects the tree but adding an edge creates a cycle. 2. The minimum spanning tree of a graph is a spanning subgraph that is a tree and has the minimum sum of edge weights. Kruskal's algorithm finds a minimum spanning tree. 3. A rooted tree has one root node with indegree 0 and all other nodes have indegree 1. Level refers to distance from the root. Binary and m-ary trees restrict the number of children per node.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 22

    Discrete Mathematics

    Trees

    H. Turgut Uyar Aysegul Gencata Emre Harmanc

    2007
    Content

    Trees
    Introduction
    Spanning Tree

    Rooted Trees
    Introduction
    Operation Tree
    m-ary Trees
    Tree

    Definition
    tree:
    Graph G is called a tree if G is connected and contains no cycles.
    I Graph whose connected components are trees: forest
    Tree Theorems

    Theorem
    There is exactly one path between a node pair in a tree.
    I There is a path because the tree is connected.
    I If there were more than one path:
    Tree Theorems

    Theorem
    The following statements are equivalent for a loop-free undirected
    graph G (V , E ) and |V | 2:
    1. G is a tree (is connected and has no cycles.)
    2. there is exactly one path between each node pair.
    3. G is connected, but if an edge is removed it becomes
    disconnected.
    4. G does not have a cycle, but if an edge is added between any
    two nodes a cycle is formed.

    I proof method: 1 2 3 4 1
    Tree Theorems

    Theorem
    The following statements are equivalent for a loop-free undirected
    graph T (V , E ):
    1. T is a tree.
    2. T is connected, and |V | = |E | + 1
    3. T contains no cycles, and |V | = |E | + 1
    Tree Theorems

    Theorem
    For every tree T (V , E ), if |V | 2, then T has at least two
    pendant vertices.

    Proof.
    P
    I 2|E | = v V dv
    I Assume there is one vertex of degree 1:
    2|E | 2(|V | 1) + 1
    2|E | 2|V | 1
    |E | |V | 12 > |V | 1 contradiction
    Spanning Tree

    Definition
    spanning tree:
    A subgraph T of a graph G is called a spanning tree of G, if T is a
    tree and T includes all vertices of G.

    Definition
    minimum spanning tree:
    A spanning tree for which the sum of the edge weights is minimum.
    Kruskals Algorithm

    Kruskals algorithm
    1. Set the counter i 1, select e1 E , where wt(e1 ) is
    minimum
    2. For 1 i n 2:
    if edges e1 , e2 , . . . , ei have been selected, select ei+1 from the
    remaining edges in G so that:
    I wt(ei+1 ) is minimum
    I The subgraph determined by e1 , e2 , . . . , ei , ei+1 contains no
    cycles.
    3. Replace i i + 1
    I If i = n 1 the subgraph with edges e1 , e2 , . . . , en1 is an
    optimal spanning tree of G .
    I If i < n 1 return to step 2.
    Rooted Tree

    I The tree T is a directed tree, if all edges of T are directed.


    I T is called a rooted tree if there is a unique vertex r , called
    the root, with indegree of 0, and for all other vertices v the
    indegree is 1.
    I All vertices with outdegree 0 are called leaf.
    I All other vertices are called branch node or internal node.
    Node Level

    Definition
    level:
    distance from root
    I parent: preceeding node
    I child: succeeding node
    Example

    Example
    I root: r
    I leaves: x y z u v
    I internal nodes: p n t s q w
    I parent of y : w
    children of w : y and z
    Binary Rooted Trees

    I binary rooted tree: Every node has at most 2 children


    I complete binary rooted tree: Every node has 0 or 2 children
    Operation tree

    I Mathematical operations can be represented by trees.


    I root and internal nodes contain operators
    I the leaves contain variables/constants
    Traversal of Operation Tree

    1. inorder: left sub-tree, root, right sub-tree


    2. preorder: root, left sub-tree, right sub-tree
    3. postorder:left sub-tree, right sub-tree, root

    I Changing operator precedence requires parantheses in inorder


    notation.
    Example

    Example

    uv
    t+
    w + x yz
    Example of preorder traversal

    Example

    +t / uv + w x y z
    Example of inorder traversal

    Example

    t + u v /w + x y z
    Example of postorder traversal

    Example

    t uv w x y z + /+
    m-ary Tree

    Definition
    m-ary tree:
    The outdegree of all vertices, except leaves, is m.
    m-ary Trees

    Theorem
    In an m-ary tree:
    I number of nodes n
    I number of leaves l
    I number of internal nodes i

    I n =mi +1
    I l = n i = m i + 1 i = (m 1) i + 1
    l1
    I i= m1
    Example

    Example
    How many matches are played in a tennis tournament of 27
    players?

    I a leaf for each player: l = 27


    I an internal node for each match: m = 2
    l1 271
    I number of matches: i = m1 = 21 = 26

    You might also like