C++ :: BST Comparing Parents To The Root
Mar 18, 2014
Lets say for example I have a BST that is sorted by char names, using strcmp. IF greater than 0 go right else go left.
I.E (this is just an example, they are not inserted correctly)
cat
/
dog buffalo
/ /
fish mouse zebra snake
I wanted to make a copy of this BST IF the length of the nodes are greater than the root, how would I approach this? I kinda started on this but I'm not sure if I'm making this more difficult than it should be.
void BST::copygreater(node * root, node *& dest, int & holder) {
if(!root) {
dest = NULL;
return;
}
holder = strlen(root->name) + 1; //Don't know about this? If we do a recursive call then the value would change every call?
[Code] ......
View 2 Replies
ADVERTISEMENT
Dec 9, 2013
i have written a function that gives me the square root of a number. Yes i know there is already a function in <cmath> that gives square roots but i thought it would be pretty challenging (and therefore fun) to try writing one on my own. I wrote my code while i was in school, listening to my Irish teacher ramble on and on about useless shit, so it's probably not the best possible way of finding the square root of a number.
double msqrt(double x) {
double adder=1;
double y = x;
for(int a=0; ; a++) {
if(y*y > x) y = y/2;
if(y*y <= x) break;
[code]....
View 6 Replies
View Related
Dec 13, 2014
I am having some difficulties splaying this element to the root.. Considering i have this splay tree .
0
1
2
3
4
What are the steps to get it 4 to the root?
View 1 Replies
View Related
Apr 30, 2014
Any way to travel from a leaf to the root. For example I search the tree to find the leaf i want and then trace/record the path back to the root.
View 2 Replies
View Related
May 19, 2013
I got problem in binary tree code. below is my code. When i select pre, post or inorder, the .exe is not responding.. Since in my binary tree theres no roots yet.. who do i solve it? It need condition or what?
View 1 Replies
View Related
Dec 27, 2013
I'm trying to parse the root directory of FAT32 in order to get a dir list in the root folder.
So I need to go over all the directory entries in the root directory and parse them.
My problem is that I don't know when to stop the iteration - How to get the size of the root directory?
I noticed that there is a byte in the boot sector - the number of the entries in the root - but in FAT32 the value is always 0, So how can i get the size of the directory?
View 1 Replies
View Related
Jun 19, 2013
I wrote the following recursion for finding the distance between a root and a leaf, but am not quite sure how to make it work.
Code:
int calc_depth(Node* tree, Node* zero) {
if (!tree)
return 0;
if (zero->right || zero->left == tree)
return 1;
return (zero->right ? calc_depth(tree, zero->right) : calc_depth(tree, zero->left));
}
View 14 Replies
View Related
Dec 5, 2013
I am writing a program to find the square root of a number. I am using the Newton-Raphson method..Just to clarify a bit of the code.. fabs(1/(x+1)) < 0.001 is to check for relative error..
EXAMPLE: for user entry of 100 if the iteration process ends in 10.055 the answer will return as 10 which is correct. But it isn't doing that.
It compiles I then proceed to run it..prompts me "Enter a number to find the square root of: I type 100 then hit enter...
"The square root of 100 is -1077834936"
My first time writing a program from complete scratch.
And I know there is a sqrt() function...just wanted to write my own.
Code:
#include <stdio.h>
#include <math.h>
double mysqrt(double a);
int main()
{
double a, result;
printf("Enter a number to find the square root of: ");
[Code]...
View 1 Replies
View Related
Mar 30, 2013
I am trying to computed the time it takes for a projectile to hit the ground. The problem is that i need to square the input of velocity before i do the calculation. the question I have is that if it's possible to have multiple arguments inside the brackets after main.
#include <stdio.h>
#include <math.h>
double distance (double a, double v, double g);
int square(int y);
double height(double v, double a, double g);
double time (double v, double a, double g);
double sqrt(double num);
[Code] ....
View 2 Replies
View Related
Feb 8, 2014
I want to find the root of an equation f(x) by using the secant method [URL] .....
#include <math.h>
#include <iostream>
using namespace std;
//Define function f(x)
double f(double x, double a, double b) {
return sin((a*x)/(1+x*x))*atan(b*x)+atan(x);
[Code] ....
1) Do I have to keep the function f and RootFinderSMNew in different cpp files?
2) When compiling I get the following errors:
1>------ Build started: Project: Assignment2.1, Configuration: Debug Win32 ------
1> Find Roots Secant method.cpp
[Code] .....
What am I doing wrong ?
View 1 Replies
View Related
Aug 6, 2013
I got a mesh which has an edge with a specific transformation (translation + orientation). When this configuration / transformation is changed, its neighbours are to be updated. This structure is kept inside a tree so that when a root "frame" is passed to a method like UpdateHierachy, the mesh will recursively update itself.
If, I don't pass this method the root element, which is in my case, how do I change the rest of the structure? The reason to do this is because I want to say move the door, the windows and furniture will move along with it.
View 8 Replies
View Related
Jul 13, 2014
How to write a function macro in C for finding the sqrt of a number?
View 2 Replies
View Related
Mar 1, 2013
I have been trying to write a Newton's Method program for the square root of a number and have been failing miserably...
#include <iostream>
#include <cmath>
using namespace std;
int main() {
double x1;
double y;
double x0;
[Code] .....
View 6 Replies
View Related
Apr 1, 2014
I having trouble with the rational class
here is my assignment:
Add a square root function to the rational class. Have your program print the square root of any rational number. I want to find the square root for numerator and denominator separatetly. divide the answer to get decimals and convert the decimal to fractions. i got till geting the decimal but i want to convert it back to a simplified fraction
// finding greatest common factor
int gcd(int a, int b)
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
[Code]...
View 2 Replies
View Related
Jul 28, 2014
I have my tree, and I need to find the number in the tree (given by the user) and get the distance between the node found and the root.
What I've done so far is this, but I don't think it's correct.
void BinarySearchTree::find() {
system("cls");
BinarySearchTree b;
int num;
tree_node* cur;
[Code] ....
I founded the node, but I don't know how to determine the distance.
View 3 Replies
View Related
Mar 12, 2013
I have an application which is used for calibration for electrical components. Here I want to set a rootpath for this application. I did some research and I found out that I can get the rootpath of the application (that is where the exe is stored) But what I am really looking for is once I start the application the root path should be what I assign. For instance currently the root path is "C:UsersPublicDocumentsABC.ToolsProjects" but I would like the root path to be "E:New ABC" Is this possible? I wrote some code where I call the exe of the application and it opens the file in a folder that I specify :
private void NewJournal_Click(object sender, EventArgs e)
{
string filePath = @"E:New ABCabc.vnalog"
if (!File.Exists(filePath))
{
return;
}
string SelectedFile = @"/select, " + filePath;
System.Diagnostics.Process.Start(@"E:New ABCabc.vnalog", SelectedFile);
}
Now this code open the .vnalog file in the application. And this works great..!!! How can I now change the path within the application?
View 1 Replies
View Related
Jan 22, 2013
The following code is useful to allow a user to select a particular folder in the disk directory.
Code:
void OpenFolder() {
LPMALLOC pMalloc; //,pMalloc2;
CString strDirectory;
BROWSEINFO bi;
// Gets the Shell's default allocator
wchar_t pszBuffer[MAX_PATH];
[Code] ....
However, if one uses this code over and over, one quickly becomes tired of threading one's way all the way from root directory C:. There is undoubtedly some way to designate a starting directory. The most obvious candidate to set such a target is the:
Code:
bi.pidlRoot = NULL;
But attempting to set bi.pidlRoot to a CString (directory address) errors because 'no suiitable conversion from CString to LPCITEMIDLIST exists'
How can I set the code to open at a designated address in the directory tree?
View 14 Replies
View Related
Mar 6, 2015
I'm working on a c program that generates approximations of square roots based on newton raphson method. I worked out the approximations with another method I learnt and I know this program does fine. But I don't get the concept of epsilon. Below is the code for the program
Code:
#include<stdio.h>
// function to compute absolute value
float absoluteValue(float x)
{
if(x < 0)
x = -x;
[code]....
The text I worked this code from uses the epsilon value arbitrarily. how is the epsilon value selected? I tried using this formula to derive the square root of 45. On paper I can go as far as 6.8 something. But once this value is reached it's still bigger than epsilon, so shouldn't the code keep running? The program generates 1.41 for 2, but since it could go further why does the while loop in squareRoot function terminate?
View 2 Replies
View Related
Aug 4, 2014
I tried to check the rational or irrational numbers after we take the square root. i dont get the formula. for eg. squareroot of 64 is 8 and it is rational. square root of 2 is irrational. how to check it in c++..
View 10 Replies
View Related
Aug 23, 2014
I have tried writing a code which takes two numbers from the user and calculates their square root then the roots are added up to return the sum. The program is coming out with loads of errors.
#include<iostream>
#include<cmath>
float main(){
using namespace std;
float m1,m2,m3,m4,m5;
[Code] ....
View 4 Replies
View Related
Jul 25, 2013
I need a code in c++ . It should count the Files and Directories in root folder with every folder information i need the below information
1) no of files and folder
2) how many files are there in each folder
3) with size of every folder and files it contains
I am new in c++ ....
View 1 Replies
View Related
Mar 29, 2013
I'm writing some functions pertaining to binary trees. I've used recursion once before while learning quicksort but am still quite new and unfamiliar with it. And this is my first time touching a binary tree. So my question: In my addnode function, will the return root statement at the end ever return a value other than the value passed to the function?
Code:
#include <stdlib.h>
struct tnode
{
int data;
struct tnode * left;
struct tnode * right;
}
[code]....
View 4 Replies
View Related
Oct 7, 2013
I'm a novice with C programming and i have to solve an error in the following code. The code works like you enter a password called "uoc" and it shows as OK. But surprisely when you entered another password as "Cambridge" it works fine too.
I think that the problem is in the array declaration but i'm checking resources and no success!
Code:
#include <stdio.h>
#include <string.h>
struct {
char str[8];
char ok;
} data;
[Code] ......
View 3 Replies
View Related
Feb 24, 2013
Given this code
Code:
double x=1.00,y=2,z=4;
if (y/z||++x)
x+=y/z;
printf("%f
",x); So (y/z||++x)
is true if at least one expression is true, that is either (y/z)!=0 or (++x)!=0 or both. I wonder how the comparison is done? Is (y/z) be truncated to integer or 0 be promoted to double?
View 2 Replies
View Related
Mar 6, 2015
how to compare each element of array with another,defined ? I have tried this,but didn't work.
Code:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void bill()
[Code].....
View 3 Replies
View Related
Mar 25, 2013
I am trying to make a game where you have a secret code that is coded with colors like ROYG (red,orange,yellow,green) and I am having trouble when it tells you when you have a right color in the right spot or a right color in the wrong spot when you guess a color. How can I change my code under the function int comparearray where it will compare pointers to pointers and not integers and give me the correct number of "almost" and "correct".
Code:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define ROWS 100
#define COLS 4
}
[code]....
View 4 Replies
View Related
