No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
how can i implement a polynomial class using the doubly linked list data structure such that each node of the list holds the coeffient and the exponent of the term ?
|
|
|
hi all,hope anyone can describe for me what is happining in this code,its about NaryTrees and am new with trees. public class NaryTree extends AbstractTree { protected Object key ; protected int degree ; protected NaryTree[ ] subtree ; public NaryTree(int degree){ key = null ; this.degree = degree ; … 
|
|
|
public void enqueue(Object obj) { if(count == size) throw new ContainerFullException(); else { array[rear] = obj; rear = (rear + 1) % size; count++; } } this is a code that add and object to a circular array.at the start the array is empty,rear=front=0. when we add the first element … 
|