Add Boolean instance variables to indicate whether a node pointer is a thread or regular pointer. You may not add any additional pointers to BSTNode. The whole idea of threads is that they take advantage of unused BSTNode pointers and thereby reduce the binary tree’s wasted overhead.Add setter/getter methods to access the Boolean instance variables or modify existing setters/getters as necessary. 9#include "book.h"10#include "BinNode.h"1112#ifndef BSTNODE H13#define BSTNODE H14// Simple binary tree node implementationtemplate151617 eclass BSTNode : public BinNode {18private:Кey k;E it;BSTNode* lc;// The node's key// The node's value// Pointer to left child// Pointer to right child19202122BSTNode* rc;23public:// Two constructors2425with and without initial values26BSTNode (){ lc =rc = NULL; }27BSTNode (Key K, E e, BSTNode* 1 =NULL, BSTNode* r =NULL)28{ k = K; it = e; lc = 1; rc = r; }29~BSTNode () {}// Destructor30// Functions to set and return the value and keyE& element () { return it; }313233void setElement(const E& e){ it = e; }Key& key(O { return k; }void setKey(const Key& K)3435{ k = K; }36// Functions to set and return the childreninline BSTNode* left() const { return lc; }void setLeft(BinNode* b)373839{ lc =(BSTNode*)b; }inline BSTNode* right() const { return rc; }void setRight(BinNode* b) { rc =4041(BSTNode*) b; }42// Return true if it is a leaf, false otherwisebool isLeaf()4344{ return (lcNULL) &&(rc== NULL); }==45} ;4647#endif

Actually, the value which is stored in particular location is called variable.

Answered: Add Boolean instance variables to…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Add Boolean instance variables to indicate whether a node pointer is a thread or regular pointer. You may not add any additional pointers to BSTNode. The whole idea of threads is that they take advantage of unused BSTNode pointers and thereby reduce the binary tree’s wasted overhead.
Add setter/getter methods to access the Boolean instance variables or modify existing setters/getters as necessary.

9
#include "book.h"
10
#include "BinNode.h"
11
12
#ifndef BSTNODE H
13
#define BSTNODE H
14
// Simple binary tree node implementation
template
15
16
<typename Key, typename E>
17 eclass BSTNode : public BinNode<E> {
18
private:
Кey k;
E it;
BSTNode* lc;
// The node's key
// The node's value
// Pointer to left child
// Pointer to right child
19
20
21
22
BSTNode* rc;
23
public:
// Two constructors
24
25
with and without initial values
26
BSTNode ()
{ lc =
rc = NULL; }
27
BSTNode (Key K, E e, BSTNode* 1 =NULL, BSTNode* r =NULL)
28
{ k = K; it = e; lc = 1; rc = r; }
29
~BSTNode () {}
// Destructor
30
// Functions to set and return the value and key
E& element () { return it; }
31
32
33
void setElement(const E& e)
{ it = e; }
Key& key(O { return k; }
void setKey(const Key& K)
34
35
{ k = K; }
36
// Functions to set and return the children
inline BSTNode* left() const { return lc; }
void setLeft(BinNode<E>* b)
37
38
39
{ lc =
(BSTNode*)b; }
inline BSTNode* right() const { return rc; }
void setRight(BinNode<E>* b) { rc =
40
41
(BSTNode*) b; }
42
// Return true if it is a leaf, false otherwise
bool isLeaf()
43
44
{ return (lc
NULL) &&
(rc
== NULL); }
==
45
} ;
46
47
#endif

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions