Member Avatar
what I am trying to do is store same letter to same node. For example: let say I have person, people is sent to be put into a node. This will create two node. I want to some thing like P: Person People Person and People are same note When …
by chubbyy.putto in Software Development ()
Member Avatar
Hi,i have a code like this in .h file: #pragma once #include "stdafx.h" #include"iostream" using namespace std; // balance factor enum enum BalanceFactor { LH, RH, EH }; // treenode struct template<class T> struct TreeNode { T info; TreeNode<T>* left; TreeNode<T>* right; BalanceFactor bf; }; template<typename ItemType> class TreeType { …
by LibraryCode in Software Development ()
Member Avatar
I wrote a template class named "Tree<T>" in C++ which attributes are : - T data - std::vector<Tree*> sons; I wrote the basic methods consisting of writing and reading in those two attributes. Now, I'm writing methods that return the min and max depth. I have no compilation problems but …
by BENTABET in Software Development ()
Member Avatar
Hey Guys, I am building app using a huffman tree, and am building this java program to just test a few things and I am having some trouble. I have everything working except that I am having troble decompressing a huffman string back into the original string. I would appreciate …
by infiniteloop56 in Software Development ()
Member Avatar
I'm trying to modify this code: class Tree: def __init__(self, cargo, left=None, right=None): self.cargo = cargo self.left = left self.right = right def __str__(self): return str(self.cargo) def print_tree_inorder(tree): if tree is None: return print_tree_inorder(tree.left) print(tree.cargo, end=" ") print_tree_inorder(tree.right) So that it adds parentheses around every operator and pair of operands. …
by kxjakkk in Software Development ()
Member Avatar
hello i have an attribute in 'users' table called RegNo which refer ro region number ... so i have to select users and display them according to their region number . here is my code <body> <ul id="nav"> <li class="heb"> <a href="parentUrl" >hebron</a> <li class="bet"> <a href="parentUrl" >ramallah</a> <?php include …
by m1m6jbr in Web Development ()
Member Avatar
hi all, this is some extra credit from class we sat around cleaning up code today this is what we came up with public boolean equals2(IntTree t2){ return equals2(this.overallRoot, t2.overallRoot); } private Boolean equals2(IntTreeNode r1, IntTreeNode r2){ if(r1 == null || r2 == null){ return r1 == null && r2 …
by stephen.teacher in Software Development ()
Member Avatar
hi , i am searching for a good tree menu design for products categories to use it in my website , i need it to be flexible so i could style it as needed and also simple so i can target it with my own javascript. thanks again.
by samertaha in UI / UX Design ()
Member Avatar
Hello. I'm developping a project about the decision tree in Java. My project idea is about animals, but it's gonna be a big database and i don't have too much time to complete. So my question is: Can anyone help me to found a complete database about animals or about …
by hannahaddad 15 in Software Development ()
Member Avatar
hey guys, so im creating a page using php html js etc and what i wanna do is have two tables on that page. the first table is populated by data from database(easy) the second table is tricky for me. in the second table i want to be able to …
by nadiam in Web Development ()
Member Avatar
this code was error.please help me fix it include <iostream> include <conio.h> include <algorithm> using namespace std; int a[]={1,5,7,4,9,8}; BST*binary_search_tree; struct BST{ int value; BST* left; BST* right; }; int search_bst(BST* node,int key){ if(node==NULL) return -1; if(key<node->value) return search_bst(node->left,key); if(key>node->value) return search_bst(node->right,key); else return node->value; } void insert_bst(BST* &treeNode,BST* newNode){ …
by gu mi nam in Software Development ()
Member Avatar
so i got a class going for making and showing tree elements, i need some help with the following: i need to display the leaves and the height of the tree. here is the code: // ar.cpp #include <iostream> #include <stdlib.h> using namespace std; class nod { public: char inf; …
by dan.doca in Software Development ()
Member Avatar
Hey! So I am having trouble with this [problem](projecteuler.net/problem=18)! Basically you have to find the path that gives the largest sum down this tree: 75 95 64 17 47 82 18 35 87 10 20 04 82 47 65 19 01 23 75 03 34 88 02 77 73 07 …
by Krokcy 14 in Software Development ()
Member Avatar
**hello peeps and geeks, i am missing the MinSpanningTree function here.. any help please? need to fill up the function to get a) Minimum spanning tree cost for the graph b)Spanning tree path for the graph. E.g in matrix or adjancency list. ** #include <iostream> #include <ctime> // For time() …
by electrodelic in Software Development ()
Member Avatar
would any one give me idea or code about how to make a binary search tree of apple Ltd products prices. suppose products are: macbook i3, macbook i5, macbook i7, iphone 3g, iphone 3gs, iphone 4, iphone 4s, iphone 5, iphone 5s, iphone 5c, ipand 2, ipad mini.
by muhammadnasiri in Software Development ()
Member Avatar
Hey everyone, I really need help in solving a problem that I have to use recursion for. I have a list of paper objects. Each paper object has its own author(s) objects. Each author object knows which paper(s) objects they belong to. I have to build a scholarly neighborhood for …
by CheerfulBiscuit in Software Development ()
Member Avatar
I have to write the an AVLTree in python, followed all the instructions and I feel I have it just right, only problem is I can't figure out how to display my tree. I have to use the test given below, as well as the 2 methods below in the …
by dp121307 in Software Development ()
Member Avatar
Hello, I'm trying to write a program that takes an input file name and lists the folders in a heirarchy ex.Folder subfolder etc I have most of my code, but I'm getting 2 errors that are connected and I have no idea how to fix it. Here is my code: …
by eldiablo1121 in Software Development ()
Member Avatar
[CODE]//To convert postfix expression into an expression tree #include"stdio.h" #include"conio.h" #include"process.h" #include"string.h" #include"stdlib.h" struct node{ char item; struct node *lnode; struct node *rnode; }*stc[30],*temp,*root; typedef struct node *NODEPTR; char expression[50]; char c; int top=0; NODEPTR pop(); void push(NODEPTR); void getinput(); void inorder(NODEPTR p); int main (){ getinput(); int i,j; for(i=0;i<strlen(expression);i++) …
by sneha_ in Software Development ()
Member Avatar
Hi all, I want to create all possible combinations of a full binary tree which must have exactly 4 leaf nodes and 3 internal nodes. I want to create it using recursion and tree must be simple binary tree not a binary search tree or BST. Kindly suggest algorithm to …
by pdwivedi -2 in Software Development ()
Member Avatar
Let's use the basic example.. I have a table for tree representation with just 3 columns: ID, PARENT_ID,NAME. If I delete a record X, how can I delete all recursive records that refer as PARENT_ID of deleted record?
by Stju in Databases ()
Member Avatar
I have created my binary tree as , It Shows in List Perfectly but i want to show in Genealogy , how can we do this ..I have Pasted My Total Nodes Script Here with HTML & java script for making tables & draw lines btwn nodes . When I …
by best4earn 12 in Web Development ()
Member Avatar
Im trying to add Total function and isMono functions to this code. Did total already Need help with function ismono which returns whether a tree is mono (all the elements are unique aka no element appears more than one time) or not. Please this is the original program #ifndef T_H …
by harde_1 in Software Development ()
Member Avatar
Hi, I need a function that will take a tree as argument and return the number of ints that were typed and a correct call. would it just be preorder? like below. Please. Thanks #include "t.h" void preorder(tnode * t){ if (t == NULL) return; cout << t->info <<endl; preorder(t->left); …
by harde_1 in Software Development ()
Member Avatar
Hello All, So I'm working on hand-coding a forum-like website, just for the experience, and I want to have a similar feature as you'll see above where a thread will have its ancestors linked: "Web Development > JSP > Parent traversal of tree-like Structure" I have several beans for different …
by sciwizeh 62 in Web Development ()
Member Avatar
Hi This code not run : it show this error: incompatible types-found java.lang.String but expected HuffmanCodingAnimation.Node This line of code ` root.left.code = root.code + "0";` Here is the code: import javax.swing.*; import java.awt.*; import java.awt.event.*; import javax.swing.tree.*; /* * This program enables a user to enter text and displays …
by Dorar in Software Development ()
Member Avatar
Hi Everyone, I am trying to get the program below to work correctly. The line below is where I'm having trouble. (line 33 in PrefixCalc.java) calc = new ExpressionTree(new Scanner(console.nextLine())); When I run the program and enter "4 + 8", the scanner only picks up "4". Apparently this program was …
by coolbeanbob 17 in Software Development ()
Member Avatar
I have to write a program that creates a binary search tree from a file and output it and several other requirements. One requirement that I cannot figure out is how to find the search cost for each node. These are the instructions I was given Calculate the search cost …
by tumblinmonkeym in Software Development ()
Member Avatar
I am doing huffman coding and I have made the tree. Now I am required to traverse the tree to create bit strings associated with the characters. Then I will put the bit string and char into a map to use with encode/decode. I have been working on this for …
by tiffany.leroux.7 in Software Development ()
Member Avatar
Hi Guys, I am working on a binary search tree and I've been stuck on some code for the last couple of days. There are 2 issues that I can't seem to figure out how to fix. 1) I have a file that has a list of names and ID's …
by next_tech in Software Development ()