cll();
/* Construct without parameter */ 21 voiddisplay();
/* Show the list */ 23 /****************************************************** 24 * Useful method for list 25 *******************************************************/ 26 voidinsert_front(
intnew_data);
/* Insert a new value at head */ 27 voidinsert_tail(
intnew_data);
/* Insert a new value at tail */ 28 intget_size();
/* Get total element in list */ 29 boolfind_item(
intitem_to_find);
/* Find an item in list */ 31 /****************************************************** 32 * Overloading method for list 33 *******************************************************/ 34 intoperator*();
/* Returns the info contained in head */ 35 /* Overload the pre-increment operator. 36 The iterator is advanced to the next node. */ 41 inttotal;
/* Total element in a list */struct node { int data; int height; struct node *left; struct node *right;} node
for std::queue
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4