progress update
This commit is contained in:
parent
659b594035
commit
0a90dcf579
12
README.md
12
README.md
|
@ -652,13 +652,13 @@ if you can identify the runtime complexity of different algorithms. It's a super
|
|||
This page is just to get a grasp on ptr to ptr. I don't recommend this list traversal style. Readability and maintainability suffer due to cleverness.
|
||||
- [Pointers to Pointers](https://www.eskimo.com/~scs/cclass/int/sx8.html)
|
||||
- [ ] Implement (I did with tail pointer & without):
|
||||
- [ ] size() - returns number of data elements in list
|
||||
- [ ] empty() - bool returns true if empty
|
||||
- [x] size() - returns number of data elements in list
|
||||
- [x] empty() - bool returns true if empty
|
||||
- [ ] value_at(index) - returns the value of the nth item (starting at 0 for first)
|
||||
- [ ] push_front(value) - adds an item to the front of the list
|
||||
- [ ] pop_front() - remove front item and return its value
|
||||
- [ ] push_back(value) - adds an item at the end
|
||||
- [ ] pop_back() - removes end item and returns its value
|
||||
- [x] push_front(value) - adds an item to the front of the list
|
||||
- [x] pop_front() - remove front item and return its value
|
||||
- [x] push_back(value) - adds an item at the end
|
||||
- [x] pop_back() - removes end item and returns its value
|
||||
- [ ] front() - get value of front item
|
||||
- [ ] back() - get value of end item
|
||||
- [ ] insert(index, value) - insert value at index, so current item at that index is pointed to by new item at index
|
||||
|
|
Loading…
Reference in New Issue