No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
Re:
It is to my understanding when inserting a node to a binary search tree, the data element of the new node is compared to the data element of the node that will be the parent. Now that I have a Ternary Search Tree with two data elements and three keys … |
|
this is the code i have written so far....its in c++....i need ur help....i can't find errors...:( class Matrix { private: int rows; int cols; float *pData; public: int getrows(){return rows;} int getcols(){return cols;} void setrows(){rows=r;} void setcols(){cols=c;} private: void doCreate(); void doAdd(Matrix m); void doSub(Matrix m); void doTranspose(); void … |