TigerGirl

Hi, I am trying to understand why this statement in the book is wrong: "given a C entity, there is at most one related A entity and at most one related B entity". Is it that it doesn't apply to a specific kind of relationship?? So, if I have an …

Hi. I am trying to write a mergeSort method, but I keep getting the wrong sorted array. [CODE]public static void mergeSort(int[] num, int left, int leftEnd, int right, int rightEnd) { int [] temp = new int[num.length]; int position = left; int number = (rightEnd + leftEnd) - 1; while( …

So, I just want to know how would I change a node to an int. In my public class I have a string, boolean, count, and a Map. I have to input a string in the class. So, in the int method I'm working on would I just call the …

How would you draw a expression tree that is (a-2/(5 * b) plus 3) * (2 * d)? I am really confused on the first parenthesis. Thank you for your help.

Hello I am trying to read a node that will find the longest word in a tree. So, my method is a public static int word(Node d) So how would I have to find the length of that node? Would I just use the string that was made in the …

So, I have to write a public static method add, which takes a parameter, and adds up all the values in the N-ary tree it represents. Characterize the traversal order: preorder. - what does that mean???? So, can someone explain to me how I would do this??? thanks.

Hi. I have a recursive public static method search that takes a Tree node (any arbitrary binary tree, not necessarily a search tree) and returns whether or not that tree satisfies the order property for a binary search tree. So, my method is [CODE]public static boolean search(TN t) { if …

Hi I am trying to find out the complexity class estimate of algorithms. So, the first one is f(100) = 20, f(200) = 76, f(400) = 325, so would that be O(log2 N)? And then f(100) = 100, f(200) = 119, f(400) = 139, and this would be O(1) like …

Hi I have a method that has a reference to a linked list and an int that is the value. I want to recursively call that value to count and return how often that value is in the linked list. So, here is what I got: [CODE]public static int find(LinkedNode …