Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

3. (16 pts. Consider the SUCCESSOR function (Algorithm 4) for a general linked-structured BST implementation for a sorted map ADT. It takes as input a

image text in transcribedimage text in transcribed

3. (16 pts. Consider the SUCCESSOR function (Algorithm 4) for a general linked-structured BST implementation for a sorted map ADT. It takes as input a node u in a general BST and outputs its successor node in the BST, that is, the node whose key immediately follows the key w.key of node w, if any; otherwise it outputs NULL. It uses two auxiliary functions, FIRSTLEFTANCESTOR and FLOORENTRYNODE. Algorithm 4 SUCCESSOR ) 1: if w=NULL then return w 2: if w.right = NULL then return FIRSTLEFTANCESTOR(W) 3: return FLOORENTRYNODE(w.right) (a) Write an algorithm, using pseudocode, for the function FIRSTLEFTANCESTOR, which takes as input a node u in the BST and outputs the first ancestor u of u in the BST such that w is the ceiling entry node of the left subtree u.left of u, that is, the key w.key of w is the largest in the left subtree of u, so that, w is the predecessor of u in the BST; it outputs NULL if no such ancestor exists, or if the subtree is empty. The algorithm should run in time that is linear in the depth of node w in the BST, and use a constant amount of space. (b) Write an algorithm, using pseudocode, for the function FLOOR ENTRYNODE, which takes as input a node w in the BST and outputs the node with the smallest key in the subtree rooted at w, that is, the last left ancestor of u (or said differently, the left-most node in the subtree rooted at u); it outputs NULL if no such node exists, or if the subtree is empty. The algorithm should run in time that is linear in the height of the subtree rooted at w, and use a constant amount of space. (C) Write down tight big-Oh characterizations of the worst-case running time and space complexity of the implementation of the SUCCESSOR function (Algorithm 4) as a function of the number of nodes n in the (general) BST. Time Space 3. (16 pts. Consider the SUCCESSOR function (Algorithm 4) for a general linked-structured BST implementation for a sorted map ADT. It takes as input a node u in a general BST and outputs its successor node in the BST, that is, the node whose key immediately follows the key w.key of node w, if any; otherwise it outputs NULL. It uses two auxiliary functions, FIRSTLEFTANCESTOR and FLOORENTRYNODE. Algorithm 4 SUCCESSOR ) 1: if w=NULL then return w 2: if w.right = NULL then return FIRSTLEFTANCESTOR(W) 3: return FLOORENTRYNODE(w.right) (a) Write an algorithm, using pseudocode, for the function FIRSTLEFTANCESTOR, which takes as input a node u in the BST and outputs the first ancestor u of u in the BST such that w is the ceiling entry node of the left subtree u.left of u, that is, the key w.key of w is the largest in the left subtree of u, so that, w is the predecessor of u in the BST; it outputs NULL if no such ancestor exists, or if the subtree is empty. The algorithm should run in time that is linear in the depth of node w in the BST, and use a constant amount of space. (b) Write an algorithm, using pseudocode, for the function FLOOR ENTRYNODE, which takes as input a node w in the BST and outputs the node with the smallest key in the subtree rooted at w, that is, the last left ancestor of u (or said differently, the left-most node in the subtree rooted at u); it outputs NULL if no such node exists, or if the subtree is empty. The algorithm should run in time that is linear in the height of the subtree rooted at w, and use a constant amount of space. (C) Write down tight big-Oh characterizations of the worst-case running time and space complexity of the implementation of the SUCCESSOR function (Algorithm 4) as a function of the number of nodes n in the (general) BST. Time Space

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2018 Dublin Ireland September 10 14 2018 Proceedings Part 1 Lnai 11051

Authors: Michele Berlingerio ,Francesco Bonchi ,Thomas Gartner ,Neil Hurley ,Georgiana Ifrim

1st Edition

3030109240, 978-3030109240

More Books

Students also viewed these Databases questions