No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
3 Posted Topics
 | Hi profissionals! Happy new year : ) .... I have a binary tree project and I need to convert a fully parenthesized arithmetic expression to a binary tree. I was thinking of this algorithm: 1. input a string of expression. 2. breakdown the string and creat new node for each … |
| | Hello,, I am using the same code in my program, but there is an ( incompatible types ) error occurs in this line: result = theStack.pop(); [CODE] public void Evaluate(String x){ x = postFix; int result; char answer; int num1, num2; ListStack EvaluateStack = new ListStack(); for(int i=0; i<x.length(); i++) … |
| | Hello everybody! I have to Questions to ask please: 1) How can I find the maximum value in a single linked-list recursively? this is what I tried to do: int findMax(int key){ Node max=head; while (max != null){ if (max < max.getKey()) return(max.getNext()); } } it ends up to an … |
The End.