I'm trying this to get the hang of boost::shared_prt and weak_ptr so far I have the following
Code:
#include <iostream>
#include <string>
#include <boost/thread.hpp>
#include <boost/lambda/bind.hpp>
[Code] .....
My questions are, is the tree class defined correctly? How do I find the parent of a given node? And how does the insert part will work?
I need to set a parent for each new node being inserted but I can't get to incorporate that into my insert function.
Here's a part of my code:
struct bst_node {
string value;
T key;
bst_node<T> *left;
bst_node<T> *right;
bst_node<T> *parent;
[code].....
I am having trouble with my deleteNode function, using recursion I am trying to delete a node from a binary tree. My tree is displayed as the following...
Tree: (node)->[left child, right child]
(k)->[g,p]
(g)->[c,h]
(c)->[ ,e]
[Code]....
The result did show that it is erased but when I try to add the erase node "t" back into the tree it still exist. I am stumped on what to do when using recursion way of deleting node.
This is the delete function of binary search tree. However it won't enter the if-else statement that checks whether the node to be deleted is the left child or right child.
void DeleteNode(node* T, int number) {
node* x = new node;
node* current = new node;
node* dele = new node;
node* finder = new node;
finder = root;
[Code] ....
Below is my implementation of a Binary Search Tree, but there is a bug in the DeleteNode() function. It does not set the parent's pointer to NULL as I intended.
View 1 Replies View RelatedI want to find maximum element from a tree (not a binary tree ) ???? ...using c language...
View 1 Replies View RelatedI 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.
How would I remove the largest node in a Binary Search tree?
function prototype:
boolean remove_largest(node *& root)
{
}
I know that if there's no right child, then the root node has to be deleted. If there is a right child, then traverse that path for the largest node. But how to make this in to code that works?
I need to write a program to find the sum of depths of a binary tree, where a depth is by definition the shortest distance between a node and the root. I am required to code this using recursion.
I was thinking of first coding a helper recursion to find the depth for each node. What would be the best way to do that? If I could move from the node to the root, I believe programming this helper recursion would not be very difficult. Is there a way to progress from the node to the root?
So I am trying to create a simple binary tree that will ask the user for a command so that is either 'insert or find' and with insert they can put in a number to this tree and with find they can ask if 53 is in this tree and the program will output yes or no..
View 9 Replies View RelatedI want a recursive function that returns a pointer pointing to the node which has the minimum data in the binary tree.
That's what I wrote:
struct CP {
int data; // data of the node
CP * left; // pointer to the left subtree
CP * right; // pointer to the right subtree
[Code]....
It can only find one side of the binary tree.
I am creating a menu-driven program which creates a small database using a binary search tree. I am having issues with the last method I need for the program. The way it is coded now only gives me blank data when I print it. Here is the exact wording for the requirements for this method:
"Output a complete report to the text file named BillionaireReports.txt in increasing order by billionaire rank, that contains all data fro each record stored in the BST. Note: this is not a simple traversal. You may assume that the rank is never less than 1 and never greater that 500. Do NOT copy the data into another BST, into an array, into a linked list, or into any other type of data structure. Retrieve the data directly from the binary search tree which is stored in order by name."
Here is the method in question:
void BillionaireDatabase::displayRankReport() {
int i = 1;
for(i; i <=500; i++) {
billionaireDatabaseBST.contains(Billionaire& anItem);
[Code] ....
I know how to sort the database by the key, but I'm not sure how to sort by something that is not the key.
Here are the functions I have available via the BST (these were written by the professor)
//------------------------------------------------------------
// Constructor and Destructor Section.
//------------------------------------------------------------
BinarySearchTree();
BinarySearchTree(const ItemType& rootItem);
BinarySearchTree(const BinarySearchTree<ItemType>& tree);
virtual ~BinarySearchTree();
[Code] ....
For an assignment I have to finish prewritten code which consists of multiple source files and a header file.
Code:
#include "tree.h"
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
[Code] .....
I understand that I have to find the height by using _left->height() and _right->height() as long as it is not a null-pointer , each time I do this the values of _left and _right change. That way you can check if it is possible to go further down in the tree. I also have to use a counter to keep track of the number of layers at each side of the root. I don't understand how to implement it.
I am working on C# Project [Windows Form Application], to update treeview nodes from excelsheet [xls] Cell [row i, Column 3] Values, while on selecting treenode, it should update corresponding Column 4 Value [row i, Column 4]. For me, Treenode are populated successfully, but on selecting the treenode, it always display first Element of treenode [Not selected one].
Populated Treenode from Excel as: [ Update Child Nodes from Column 3 elements [Column 2 Contain Parent node name and Column 3 have Child Node name], if Column 2 Value is same as Parent node name [My Module], update the child nodeunder same Parent node.]
for (int i = 0; i < worksheet.UsedRange.Rows.Count; i++) {
string mynode = ((Excel.Range)worksheet.Cells[i + 1, 3]).Value2.ToString();
string mynode2 = ((Excel.Range)worksheet.Cells[i + 1, 2]).Value2.ToString();
[Code] ....
On selecting the Child Node, it always give 1st Parent node. Instead of Selected Node.
for (int i = 0; i < worksheet.UsedRange.Rows.Count - 2; i++) {
string mynodetext = ((Excel.Range)worksheet.Cells[i + 2, 3]).Value2.ToString();
string mynodetext1 = ((Excel.Range)worksheet.Cells[i + 2, 4]).Value2.ToString();
if (treeView1.SelectedNode.FirstNode.Text == mynodetext) {
this.richTextBox1.SelectedText += Environment.NewLine + mynodetext1 + Environment.NewLine;
}
}
How to get correct selected Node.
I am working with A.V.L. trees at the moment and I have to implement a program that inserts a node and if needed re-balance the tree.I have problems when I have to do a double rotation because after I insert a node the tree is messed up. This is a picture with what my program shows after i run it. [URL] .....
void length(NodeT* p,int *maxi,int l) {
if (p!=NULL) {
length(p->left,&*maxi,l+1);
if ((p->left==NULL)&&(p->right==NULL)&&(*maxi<l))
*maxi=l;
length(p->right,&*maxi,l+1);
[Code] .....
It seems that I can't delete a node without children....
#define TRUE 1
#define FALSE 1
typedef struct binary_tree_nodes_t {
struct binary_tree_nodes_t* right;
struct binary_tree_nodes_t* left;
[Code] ....
Should my search_node function return this : binary_tree_nodes**
So I can get the address of pointer , is this causing my problem ?
How would I delete the largest node in a binary search tree recursively???
View 1 Replies View Relatedhow can a breadth-first-search-tree include every node have ancestor list. every node have multiple ancestor list(because every node may be multiple parents)
input: undirected graph
For my data-structures class, I am attempting to create a binary search tree template to be used to create an AVL tree. I've written a Generic_Tree template for the BST to inherit from, and before I jump into implementing the AVL tree I'm testing the BST member functions. Everything was compiling fine until I added the BST insert() function. Now, I'm getting the following error message from my linker:
undefined reference to 'BST<void>::insert(int, void*)'
Stemming from the call in main line 16.
my makefile compiles with:
g++ -Wall -g Generic_Tree.cpp BST.cpp barfing.cpp main.cpp
Generic_Tree:
template < typename NODE_DATA, unsigned MAX_KIDS >
class Tree {
protected:
struct NODE {
NODE_DATA* contents;
Tree* child[MAX_KIDS];
Tree* parent;
[Code] ....
I'm use to c and havn't used classes or templates before (except for declaring instances of them). The whole syntax is mystifying to me,.
I am trying to delete a node(has no children). for some reason, it keeps giving me an error.
void AVLtree<T>::remove(const T& item) {
node* curr = root;
node* prev = nullptr;
node* next = nullptr;
if(curr == nullptr)
[Code] .....
the error is: Access violation reading location 0xfeeefeee.
It only prints out the root in an infinite loop.
Code: void Btree::printTree(Node* tree)
{
tree=root;
if (tree != NULL)
{
std::cout<<" "<< tree->key;
printTree(tree->left);
printTree(tree->right);
}
}
It has been a while since I built a binary tree from scratch so I decided to do it. Everything works fine but this one function. When I enter a number to search it just keeps running and allowing me to keep enter numbers.
Code:
void tree::search(int key,Node* leaf) {
if (leaf == NULL) {
std::cout<<"The tree is empty
[Code] ......
I have a problem with the C code . I created two functions, one that runs through the tree inorder, the other that returns the maximum value in the tree. The problem is when I use in the main the method "max", which goes in a loop and not print anything on the screen . If I remove the call to method "max" it works fine. Here's the code:
Code:
#include<stdio.h>
#include<stdlib.h>
#define bool int
/* A binary tree tNode has data, pointer to left child
and a pointer to right child */
struct tNode {
[Code]...
I just want to ask if some of you know good source for learning about Binary Trees.
View 2 Replies View RelatedI've almost got my code working. My issue is, if I type in either one of the first two id numbers, it finds the person and displays as it's supposed to, however if I type any of the last 6 id numbers it says id not found. I've been staring at this forever and can't see what I'm missing />/> ps, I haven't added in all my comments yet Binary tree template
//Binray tree template class
#ifndef BINARYTREE_H
#define BINARYTREE_H
[Code].....
I want to print binary tree in this form on screen
1
/
2 3
/ /
4 5 6 7
/ /
8 9 10 11
This is the code for creating Binary Tree:
#include<stdio.h>
struct node
{
int data;
struct node *right;
struct node *left;
};
struct node *root = NULL;
int main ()
{
struct node *child, *temp;
[Code]...
