For example, the code on the left should create a tree on the right: int main () { PrefixTreeNode *root = new PrefixTreeNode () : root .children (1] children(3] insert (root, "cat"): b d children [14] insert (root, "car"): .children [4] insert (root, "dog"): e a .wordEnds == true insert (root, "do") : .children [4] children[17) insert (root, "bee"); e t g insert (root, "dorm") : . wordEnds =- .children[12] true delete root: m .wordEnds == true Fill in the insert method below that inserts a string t to the prefix tree rooted at root. void insert (PrefixTreeNode *root, const string &t) { // Copy this function in answer and add code below this line.
For example, the code on the left should create a tree on the right: int main () { PrefixTreeNode *root = new PrefixTreeNode () : root .children (1] children(3] insert (root, "cat"): b d children [14] insert (root, "car"): .children [4] insert (root, "dog"): e a .wordEnds == true insert (root, "do") : .children [4] children[17) insert (root, "bee"); e t g insert (root, "dorm") : . wordEnds =- .children[12] true delete root: m .wordEnds == true Fill in the insert method below that inserts a string t to the prefix tree rooted at root. void insert (PrefixTreeNode *root, const string &t) { // Copy this function in answer and add code below this line.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![For example, the code on the left should create a tree on the right:
int main () {
PrefixTreeNode *root = new PrefixTreeNode () ;
root
.children [l]
children (3]
insert (root, "cat"):
d.
.children [14]
insert (root,
"car");
.children [4]
insert (root, "dog");
e
a
. wordEnds == true
insert (root, "do");
.children [4]
.children[17]
insert (root, "bee");
e
r
insert (root, "dorm");
. wordEnds == true
children [12]
delete root;
m
wordEnds ==
true
Fill in the insert method below that inserts a string t to the prefix tree rooted at root.
void insert (PrefixTreeNode *root, const string &t) {
// Copy this function in answer and add code below this line.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff5bb9956-2539-4c8d-9ee9-02ed0be838be%2F0486b20a-1654-4154-af31-d7c6c48c7f55%2Fhkmv3qr_processed.png&w=3840&q=75)
Transcribed Image Text:For example, the code on the left should create a tree on the right:
int main () {
PrefixTreeNode *root = new PrefixTreeNode () ;
root
.children [l]
children (3]
insert (root, "cat"):
d.
.children [14]
insert (root,
"car");
.children [4]
insert (root, "dog");
e
a
. wordEnds == true
insert (root, "do");
.children [4]
.children[17]
insert (root, "bee");
e
r
insert (root, "dorm");
. wordEnds == true
children [12]
delete root;
m
wordEnds ==
true
Fill in the insert method below that inserts a string t to the prefix tree rooted at root.
void insert (PrefixTreeNode *root, const string &t) {
// Copy this function in answer and add code below this line.
![The prefix tree is a search tree data structure to store a set of strings. A prefix tree has the following properties:
• Each prefix tree has a root indicating the start of each string.
• Each path from the root node in the tree corresponds to a prefix of some string.
• Each node has a flag to denote if the prefix is actually also a string in the set.
For example, suppose we have 4 strings: "cat", "car", "dog", and "do". The corresponding prefix tree should conceptually be as follows, where the shaded nodes indicate the end of a string.
root
d
a
Assume the strings only contain lowercase English letters.
The PrefixTreeNode class is given below.
class PrefixTreeNode
public:
PrefixTreeNode *children [26]; // the child nodes for 26 letters
bool wordEnds; // indicates the end of a string
PrefixTreeNode ()
wordEnds = false;
for (int i = 0; i < 26; i++)
children [i] = NULL;
} ;
children is an array of pointers pointing to sub-prefix-trees of the 26 English letters. At each node, children[0] corresponds to the tree for the next letter being 'a', children [1] corresponds to the tree for letter 'b', children [2] corresponds to
letter 'c', and so on.
wordEnds is the flag indicating if there is a string that ends at the current node.
For example, the code on the left should create a tree on the right:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff5bb9956-2539-4c8d-9ee9-02ed0be838be%2F0486b20a-1654-4154-af31-d7c6c48c7f55%2Flmig5gx_processed.png&w=3840&q=75)
Transcribed Image Text:The prefix tree is a search tree data structure to store a set of strings. A prefix tree has the following properties:
• Each prefix tree has a root indicating the start of each string.
• Each path from the root node in the tree corresponds to a prefix of some string.
• Each node has a flag to denote if the prefix is actually also a string in the set.
For example, suppose we have 4 strings: "cat", "car", "dog", and "do". The corresponding prefix tree should conceptually be as follows, where the shaded nodes indicate the end of a string.
root
d
a
Assume the strings only contain lowercase English letters.
The PrefixTreeNode class is given below.
class PrefixTreeNode
public:
PrefixTreeNode *children [26]; // the child nodes for 26 letters
bool wordEnds; // indicates the end of a string
PrefixTreeNode ()
wordEnds = false;
for (int i = 0; i < 26; i++)
children [i] = NULL;
} ;
children is an array of pointers pointing to sub-prefix-trees of the 26 English letters. At each node, children[0] corresponds to the tree for the next letter being 'a', children [1] corresponds to the tree for letter 'b', children [2] corresponds to
letter 'c', and so on.
wordEnds is the flag indicating if there is a string that ends at the current node.
For example, the code on the left should create a tree on the right:
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY