Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
Unknown Quality Score

No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.

0 Endorsements
~4K People Reached
Favorite Tags
c++ x 4
c x 3
Member Avatar for peachslasher

Hi guys, I am trying to write C++ method to return a pointer to the parent of a particular node in binary tree, and for the root that doesn't have a parent should return NULL. Here is my program so far: [CODE]#include <iostream> using namespace std; class Tree { private: …

Member Avatar for che-burator
0
3K
Member Avatar for MikkaD

Hi All! I'm a new user to this site. I came here because I just read an article on Yahoo about how the tech industry is on [COLOR="Red"]fire! [/COLOR] Hiring freeze, what hiring freeze? So I'm interested!! Always liked computers, but never thought of them as a career. Now I'm …

Member Avatar for mackone
0
264
Member Avatar for peachslasher

Hi guys I am trying to implement a buddy system using C, I've free the memory using myfree() and i've allocated memory using mymalloc(). I've tried to run the program, but it keep on generating segmentation error, would you guys please see the code, and tell me if you've spotted …

0
70
Member Avatar for peachslasher

Hi guys, By any chance do any of you guys know any way to implement an array of linked list without using vector, since i need to implement an array of linked list using c and unfortunately vector library is unavailable. This is what i did: [code] Struct MyList{ int …

Member Avatar for peachslasher
0
132
Member Avatar for peachslasher

Hi all, I am having trouble understanding BST recursive algorithm. Here is the code: [CODE] int maxDepth(struct node* node) { if (node==NULL) { return(0); } else { // compute the depth of each subtree int lDepth = maxDepth(node->left); int rDepth = maxDepth(node->right); // use the larger one if (lDepth > …

Member Avatar for Alex Edwards
0
107
Member Avatar for peachslasher

Hey guys, I need to write a C++ program that use to compare sorting algorithm. I've tried to implement counter on each of <.>, = operations I've encounter in the function (currently i am working on selection sort), however the sum of the counter doesn't really match big O selection …

Member Avatar for Radical Edward
0
269
Member Avatar for peachslasher

Hi, I've question regarding visiting and printing nodes for tree traversal. the main purpose of my program is to create tree for an arithmetic expression and then perform in-order and post-order traversal on the tree. The structure tree need to be hard-coded in the program using linked-list/pointer stored in one …

Member Avatar for Salem
0
146