payload: {"action":"opened","issue":{"url":"https://api.github.com/repos/domfarolino/algorithms/issues/144","repository_url":"https://api.github.com/repos/domfarolino/algorithms","labels_url":"https://api.github.com/repos/domfarolino/algorithms/issues/144/labels{/name}","comments_url":"https://api.github.com/repos/domfarolino/algorithms/issues/144/comments","events_url":"https://api.github.com/repos/domfarolino/algorithms/issues/144/events","html_url":"https://github.com/domfarolino/algorithms/issues/144","id":549840251,"node_id":"MDU6SXNzdWU1NDk4NDAyNTE=","number":144,"title":"Implement iterator for binary_search_tree<T>","user":{"login":"domfarolino","id":9669289,"node_id":"MDQ6VXNlcjk2NjkyODk=","avatar_url":"https://avatars1.githubusercontent.com/u/9669289?v=4","gravatar_id":"","url":"https://api.github.com/users/domfarolino","html_url":"https://github.com/domfarolino","followers_url":"https://api.github.com/users/domfarolino/followers","following_url":"https://api.github.com/users/domfarolino/following{/other_user}","gists_url":"https://api.github.com/users/domfarolino/gists{/gist_id}","starred_url":"https://api.github.com/users/domfarolino/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/domfarolino/subscriptions","organizations_url":"https://api.github.com/users/domfarolino/orgs","repos_url":"https://api.github.com/users/domfarolino/repos","events_url":"https://api.github.com/users/domfarolino/events{/privacy}","received_events_url":"https://api.github.com/users/domfarolino/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2020-01-14T21:53:23Z","updated_at":"2020-01-14T21:53:23Z","closed_at":null,"author_association":"OWNER","body":"API-wise, both `min()` and `max()` should return iterators, and we should introduce the following methods:\r\n\r\n - `begin()`: returns the result of `min()`.\r\n - `end()`: returns an iterator pointing to nullptr\r\n - `find()`: returns an iterator pointing to the a found value. Similar to `exists()`, but with an iterator return value\r\n\r\n A `binary_search_tree<T>::iterator` should support the following operations:\r\n - Pre-increment\r\n   - Should rely on a newly-introduced static binary_search_tree<T>::inorder_successor\r\n - Post-increment\r\n   - ditto\r\n - Pre-decrement\r\n   - Should rely on a newly-introduced static binary_search_tree<T>::inorder_predecessor\r\n - Post-decrement\r\n   - ditto\r\n\r\nTODO: Given iterator increment and decrement support, does that imply we want to mark the iterator as a bidirectional iterator?"}}
other: {"actor":{"display_login":"domfarolino"}}