Scribd Logo
Upload

Welcome to Scribd!

  • Exercise Set 9: CSC2100 Data Structure

    Uploaded by

    breezest
    11 views4 pages
    Exercise set 9 CSC2100 Data Structure show the AVL-tree after inserting key 36. 40 Show the avil-tree before and after deleting key 35. 30 15 40 35 Let S be a set of n horizontal segments, and p be set of m points. Give an algorithm to find, for each point p [?] p, the segment in S above it. Your algorithm should terminate in O(n log n + m log m) time

    Original Description:

    Original Title

    Ex 9

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Exercise set 9 CSC2100 Data Structure show the AVL-tree after inserting key 36. 40 Show the avil-tree before and after deleting key 35. 30 15 40 35 Let S be a set of n horizontal segments, and p be set of m points. Give an algorithm to find, for each point p [?] p, the segment in S above it. Your algorithm should terminate in O(n log n + m log m) time

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    11 views4 pages

    Exercise Set 9: CSC2100 Data Structure

    Uploaded by

    breezest
    Exercise set 9 CSC2100 Data Structure show the AVL-tree after inserting key 36. 40 Show the avil-tree before and after deleting key 35. 30 15 40 35 Let S be a set of n horizontal segments, and p be set of m points. Give an algorithm to find, for each point p [?] p, the segment in S above it. Your algorithm should terminate in O(n log n + m log m) time

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    Exercise set 9

    CSC2100 Data Structure

    CUHK

    April 6, 2010
    Show the AVL-tree after inserting key 36.
    40

    15 73

    10 30 60 80

    3 20 35
    Show the AVL-tree after deleting key 35.
    30

    15 40

    10 20 35

    3 25
    Let S be a set of n horizontal segments, and P be a set of m
    points, all in a 2d space. Give an algorithm to find, for each point
    p ∈ P, the segment in S above it. Your algorithm should
    terminate in O(n log n + m log m) time.
    Example
    s1

    p1 s2

    p3 s4 p4
    p2
    s3

    S = {s1 , ..., s4 }, P = {p1 , ..., p4 }.


    Result = {(p1 , s1 ), (p2 , s2 ), (p3 , s2 ), (p4 , ∅)}.

    You might also like