139 Topics
 | |
| | What are the settings I require so I can debug line -by line? Or else ,I can identify lines of code where run time errors are occuring.. I want to view exact line number of error in this code/[CODE]#include<stdio.h> #include<conio.h> #include<string.h> struct node {struct node * left,*right; int freq; char … |
| | I'm having a problem with adding the name, dob month, dob day, and dob year to a binary search tree from the information from the GUI. This has to happen after the "Add Person" button is clicked. I should add it inside the brackets of the "if(e.getSource() == addPersonButton)" statement, …  |
| | Now, I know the first thing I am going to be told is that I should add a balance function to my binary tree, well I have asked the group member who created our tree to do it, but he hasn't got back to me yet. So rather than wait …  |
| | Can anyone please debug the following binary tree program, it flashes two errors: 1: Type mismatch in redeclaration of 'strdup' 2: Tpe mismatch in redeclaration of 'talloc' [CODE]#include<stdio.h> #include<ctype.h> #include<string.h> #define MAXWORD 100 struct tnode *addtree(struct tnode *, char *); void treeprint(struct tnode *); struct tnode { char *word; int …  |
| | I was trying to find a solution for checking the symmetry of a tree. I would like to get some comments on the approach.. I am trying to do it by modifying the inorder traversal thing.. The pseudo code is: [CODE] // since the structure should be similar string in1,in2; …  |
| | Hello there, I'm busy working on a project using GWT and Sencha GXT libraries. I have come to this stage that I now have to populate a tree with data received from an XML file... I have no idea how to do this, I've gone through the javaDocs but it … |
| | Hi there, I'm working on a map for a class assignment and running into trouble. I've tried looking around the web but couldn't find anything that helped. I know how insertion works on a basic level when returning a node pointer but think i'm missing some key ideas when using … |
| | The application is currently developed using ASP.NET (C#) I have code to pull data from a SQL Server 2008 table and organize it into an hierarchy: [code=sql] With hierarchy (id, [location id], name, depth, trail) As ( -- selects the "root" level items. Select ID, [LocationID], Name, 1 As depth, … |
| | hi. Im trying to make an expresion tree for every ER that I read each ER will be transformed into postfix and saved in a string, which I'll be sending to arbol_expresion() to create it`s tree expression Searching on the web I found a method to convert the postfix expresion … |
| | I'm having trouble formatting a binary tree. In my program, the tree format should print every output as such: 35 30 29 25 24 20 15 This is the code that I have thus far. [CODE]public void treeFormatTraversal(){//begin int level = 0; if(root !=null) treeFormatHelper(root, level); else System.out.println("\nTree is Empty\n"); … |
| | Okay, so I have a rather easy problem that I can't seem to figure out. I'm getting cannot find symbol errors for T item=(T)input.next(); The program is a test file for a Binary Tree program. I was told the input 'item' has to be in T type. Obviously they have …  |
| | Hey All, I have written a script that uses elementTree to work on python 2.4. Took quite a while and worked a threat but now I need to get it working on 2.3.4. I can't upgrade the version of python. Is there an equivelent version of the element tree for … |
| | I desperately need help with a project I am working on. I need to create and implement a Binary Search Tree Header file. I am having great difficulty with this and was hoping I could find some help here. This is what I have done(note: I am aware that the … |
| | Hi, I have an expression tree in which the nodes are operators (union, intersection etc represented by a string "/u") or the nodes are std::sets. How could I access the std::set's values in order to carry out the tree evaluation using the operator functions(set_union(), set_intersection() etc) ? The expressions are …  |
| | Hello, I'm getting quite flustered with this program and the errors are starting to get harder to debug. This is my tree.java file: [CODE]package TreePkg; import java.io.FileNotFoundException; import java.lang.SecurityException; import java.util.Scanner; import java.util.NoSuchElementException; import java.io.ObjectInputStream; import java.io.ObjectOutputStream; import java.io.FileInputStream; import java.io.FileOutputStream; import java.io.Serializable; import java.io.EOFException; class TreeNode<T extends Comparable <T>> … |
| | Hello, I would like to know if you can change the index of a tree view node before and or after its created. If so how. Basically manually assigning each node its offsets through code. Thanks, TheShyGuy |
| | Hey all, I'm writing a program that is an address book using an AVL Node structure (which was provided). I defined the [I]contact[/I] class as the ItemType of the data to be inserted in each node. Initially I encountered a Segmentation fault that occured during the assignment from the AVLClass … |
| | Hey all, I'm doing a project to create an address book which uses a binary search tree (AVL node) structure to store, search and sort the data. There are 14 main fields for each address contact. All fields can be represented as strings. The 14th field can have unlimited entries. … |
| | I am doing a project where i have to insert a list of players and stats into a binary search tree Here is the project description For this final assignment, you will be creating a binary search tree. You will be able to utilize some of your previous assignment code, … |
| | Hi My program is supposed to implement a binary tree with an insert, remove, copy, pre-order, post-order and in-order views. Problem is that my code compiles... but doesnt work. Could someone help me out. Thanks. I attached the code... [ATTACH]18222[/ATTACH] [ATTACH]18223[/ATTACH] [ATTACH]18224[/ATTACH] |
| | Hi all, So I have reached a kind of impasse on my current project. I'm trying to make a program that can function like a phone book, loading information from a file into a binary search tree and performing operations on said information. The issue I'm having appears to be … |
| | Hello people, I decided to make a family tree as a graduation project, I've thought about multiple ways to make it, but I like some fresh ideas, in case i forgot some things. I'm trying to keep the project as easy as possible, because in the end I will need … |
| | Alright, so I've spent countless hours on this code and I need a fresh pair of eyes to give it a glance... This is my third assignment for my datastructures class, where I am to write code that turns a fully parenthesized expression (such as "((3+2)/(3-8))") into aan "arithemtic expression … |
| | Hi there ! I have a tree view control and a button in Form1. The button takes me to Form2 which has a text box and a save button. What I'm trying to do is get the button on Form2 to add what i have typed in the textbox as …  |
| | I have a tree, and I want to find the depth of it. For example for this tree: [CODE]0 root / \ 1 5 1 / \ 2 1 3 | 3 2[/CODE] It should give a depth of 3. [CODE] public int getDepth() { int maxDepth = 0; if(this.hasChildren()) … |
| | [CODE] #ifndef VECTORBINARYTREE_H #define VECTORBINARYTREE_H template<typename Object> class ArrayVector{ private: int capacity; int sz; Object* a; protected: void overflow() { capacity*=2; Object* b=new Object[capacity]; for(int i=0;i<sz;i++) b[i]=a[i]; delete []a; a=b; } public: ArrayVector(int initCap=16){ capacity = initCap; sz=0; a = new Object[capacity]; } int size() const {return sz;} bool isEmpty() … |
| | My first post on this forum, long time lurker though. I'm running into a problem trying to search through an N-ary tree. I'm tasked with having the user input pairs of job titles and from there putting them into an N-ary tree, with the higher job titles at higher levels. … |
 | What I have is a list of file paths: dir0/file0.txt dir0/dir1/filea.txt dir0/file1.txt dir0/dir1/fileb.txt dir0/dir1/dir1/filec.txt dir0/file2.txt What I'd like to get is something like the following: [code] $paths=Array( file0.txt=>file0.txt, dir1=>Array( filea.txt=>filea.txt, fileb.txt=>fileb.txt, dir1=>Array( filec.txt=>filec.txt ) ), file1.txt=>file1.txt, file2.txt=>file2.txt ); [/code] It strikes me that this must be a fairly common requirement … |
| | I am going out of town and don't have access to my professor and / or tutors for the weekend, and we have an assignment involving a BST. I have done all of my insert, remove, and search functions, and went to the tutor about the remaining ones I have, … |
| | I wrote this simple program in C to generate binary search tree, but i am unable to go beyond level 0. Note that I have not incorporated the printing part. [code] #include<stdio.h> #include<malloc.h> struct node { int data; struct node *lc; struct node *rc; }*start,*link,*tmp; int a[100]; int main() { … |
The End.