Can anyone help me to convert below code from c# to c++?
// C#:
public class TernaryTree
{
private Node m_root = null;
private void Add(string s, int pos, ref Node node)
{
if (node == null) { node = new Node(s[pos], false); }
if (s[pos] < node.m_char) { Add(s, pos, ref node.m_left); }
else if (s[pos] > node.m_char) { Add(s, pos, ref node.m_right); }
else
{
if (pos + 1 == s.Length) { node.m_wordEnd = true; }
else { Add(s, pos + 1, ref node.m_center); }
}
}
public void Add(string s)
{
if (s == null || s == "") throw new ArgumentException();
Add(s, 0, ref m_root);
}
public bool Contains(string s)
{
if (s == null || s == "") throw new ArgumentException();
int pos = 0;
Node node = m_root;
while (node != null)
{
int cmp = s[pos] - node.m_char;
if (s[pos] < node.m_char) { node = node.m_left; }
else if (s[pos] > node.m_char) { node = node.m_right; }
else
{
if (++pos == s.Length) return node.m_wordEnd;
node = node.m_center;
}
}
return false;
}
}
And here is the Node class:
class Node
{
internal char m_char;
internal Node m_left, m_center, m_right;
internal bool m_wordEnd;
public Node(char ch, bool wordEnd)
{
m_char = ch;
m_wordEnd = wordEnd;
}
}C++:
//.h file code:
#include <string>
#include <stdexcept>
class TernaryTree
{
private:
Node *m_root = nullptr;
public:
virtual ~TernaryTree()
{
delete m_root;
}
private:
void Add(const std::wstring &s, int pos, Node *&node);
public:
void Add(const std::wstring &s);
bool Contains(const std::wstring &s);
};
//.cpp file code:
#include "snippet.h"
void TernaryTree::Add(const std::wstring &s, int pos, Node *&node)
{
if (node == nullptr)
{
node = new Node(s[pos], false);
}
if (s[pos] < node->m_char)
{
Add(s, pos, node->m_left);
}
else if (s[pos] > node->m_char)
{
Add(s, pos, node->m_right);
}
else
{
if (pos + 1 == s.length())
{
node->m_wordEnd = true;
}
else
{
Add(s, pos + 1, node->m_center);
}
}
}
void TernaryTree::Add(const std::wstring &s)
{
if (s == L"" || s == L"")
{
//This exception's constructor requires an argument:
//ORIGINAL LINE: throw new ArgumentException();
throw std::invalid_argument();
}
Add(s, 0, m_root);
}
bool TernaryTree::Contains(const std::wstring &s)
{
if (s == L"" || s == L"")
{
//This exception's constructor requires an argument:
//ORIGINAL LINE: throw new ArgumentException();
throw std::invalid_argument();
}
int pos = 0;
Node *node = m_root;
while (node != nullptr)
{
int cmp = s[pos] - node->m_char;
if (s[pos] < node->m_char)
{
node = node->m_left;
}
else if (s[pos] > node->m_char)
{
node = node->m_right;
}
else
{
if (++pos == s.length())
{
return node->m_wordEnd;
}
node = node->m_center;
}
}
return false;
}
///And here is the Node class:///
//.h file code:
class Node
{
public:
wchar_t m_char = L'\0';
Node *m_left, *m_center, *m_right;
bool m_wordEnd = false;
virtual ~Node()
{
delete m_left;
delete m_center;
delete m_right;
}
Node(wchar_t ch, bool wordEnd);
};
//.cpp file code:
#include "snippet.h"
Node::Node(wchar_t ch, bool wordEnd)
{
m_char = ch;
m_wordEnd = wordEnd;
}
Can anyone help me to convert below code from c# to c++? // C#: public class...
Can Anyone help me to convert Below code to C++! Thanks For example, in C++, the function headers would be the following: class MaxHeap { vector<int> data; public: MaxHeap() { // ... } int size() { // ... } int maxLookup() { // ... } void extractMax() { // ... } void insert(int data) { // ... } void remove(int index) { // ... } }; ======================== import java.util.Arrays; import java.util.Scanner; public class MaxHeap { Integer[] a; int size; //...
Java StringNode Case Study: Rewrite the following methods in the StringNode class shown below. Leave all others intact and follow similar guidelines. The methods that need to be changed are in the code below. - Rewrite the indexOf() method. Remove the existing recursive implementation of the method, and replace it with one that uses iteration instead. - Rewrite the isPrefix() method so that it uses iteration. Remove the existing recursive implementation of the method, and replace it with one that...
Convert into pseudo-code for below code =============================== class Main { public static void main(String args[]) { Scanner s=new Scanner(System.in); ScoresCircularDoubleLL score=new ScoresCircularDoubleLL(); while(true) { System.out.println("1--->Enter a number\n-1--->exit"); System.out.print("Enter your choice:"); int choice=s.nextInt(); if(choice!=-1) { System.out.print("Enter the score:"); int number=s.nextInt(); GameEntry entry=new GameEntry(number); ...
I need help with todo line please public class LinkedList { private Node head; public LinkedList() { head = null; } public boolean isEmpty() { return head == null; } public int size() { int count = 0; Node current = head; while (current != null) { count++; current = current.getNext(); } return count; } public void add(int data) { Node newNode = new Node(data); newNode.setNext(head); head = newNode; } public void append(int data) { Node newNode = new Node(data);...
In Chapter 11, you created the most recent version of the GreenvilleRevenue program, which prompts the user for contestant data for this year’s Greenville Idol competition. Now, save all the entered data to a Greenville.ser file that is closed when data entry is complete and then reopened and read in, allowing the user to view lists of contestants with requested talent types. The program should output the name of the contestant, the talent, and the fee. using System; using static...
Java help: Please help complete the locate method that is in bold.. public class LinkedDoubleEndedList implements DoubleEndedList { private Node front; // first node in list private Node rear; // last node in list private int size; // number of elements in list ////////////////////////////////////////////////// // YOU MUST IMPLEMENT THE LOCATE METHOD BELOW // ////////////////////////////////////////////////// /** * Returns the position of the node containing the given value, where * the front node is at position zero and the rear node is...
Java Programming: The following is my code: public class KWSingleLinkedList<E> { public void setSize(int size) { this.size = size; } /** Reference to list head. */ private Node<E> head = null; /** The number of items in the list */ private int size = 0; /** Add an item to the front of the list. @param item The item to be added */ public void addFirst(E...
Im writing a method to evaluate a postfix expression. Using my own stack class. Here is my code but I keep getting a classcastexception where it says java.lang.Character cannot be cast to java.lang,Integer. Im not sure how to fix this. public class Evaluator { public static void evaluatePost(String postFix) { LinkedStack stack2 = new LinkedStack(); int val1; int val2; int result; for(int i = 0; i < postFix.length(); i++) { char m = postFix.charAt(i); if(Character.isDigit(m)) { stack2.push(m); } else { ...
Java: Return an array of booleans in a directed graph. Please complete the TODO section in the mark(int s) function import algs13.Bag; import java.util.HashSet; // See instructions below public class MyDigraph { static class Node { private String key; private Bag<Node> adj; public Node (String key) { this.key = key; this.adj = new Bag<> (); } public String toString () { return key; } public void addEdgeTo (Node n) { adj.add (n); } public Bag<Node> adj () { return adj;...
Can anyone help me fix this program to make sure use stack and use STL library to check the name1 and name2 is palindrome. Thank you stackPalindrome.h #ifndef_STACK_PALINDROME_H #define_STACK_PALINDROME_H template <class StackPalindrome> class StackPalindrome { public: virtual bool isEmpty() const = 0; virtual bool push(const ItemType& newEntry) = 0; virtual bool pop() = 0; virtual ItemType peek() const = 0; }; #endif stack.cpp #include<iostream> #include<string> #include<new> #include "stackPalindrome.h" using namespace std; template <class ItemType> class OurStack...