{"action":"opened","issue":{"url":"https://api.github.com/repos/jasonmcboyd/Treenumerable/issues/15","repository_url":"https://api.github.com/repos/jasonmcboyd/Treenumerable","labels_url":"https://api.github.com/repos/jasonmcboyd/Treenumerable/issues/15/labels{/name}","comments_url":"https://api.github.com/repos/jasonmcboyd/Treenumerable/issues/15/comments","events_url":"https://api.github.com/repos/jasonmcboyd/Treenumerable/issues/15/events","html_url":"https://github.com/jasonmcboyd/Treenumerable/issues/15","id":148560651,"number":15,"title":"Fix TreeWalker.LevelOrderTraversal","user":{"login":"jasonmcboyd","id":6041252,"avatar_url":"https://avatars.githubusercontent.com/u/6041252?v=3","gravatar_id":"","url":"https://api.github.com/users/jasonmcboyd","html_url":"https://github.com/jasonmcboyd","followers_url":"https://api.github.com/users/jasonmcboyd/followers","following_url":"https://api.github.com/users/jasonmcboyd/following{/other_user}","gists_url":"https://api.github.com/users/jasonmcboyd/gists{/gist_id}","starred_url":"https://api.github.com/users/jasonmcboyd/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jasonmcboyd/subscriptions","organizations_url":"https://api.github.com/users/jasonmcboyd/orgs","repos_url":"https://api.github.com/users/jasonmcboyd/repos","events_url":"https://api.github.com/users/jasonmcboyd/events{/privacy}","received_events_url":"https://api.github.com/users/jasonmcboyd/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2016-04-15T05:47:25Z","updated_at":"2016-04-15T05:47:25Z","closed_at":null,"body":"The method makes use of multiple `Concat` operations.  The runtime is proportional to the square of the number of concats: https://blogs.msdn.microsoft.com/wesdyer/2007/03/23/all-about-iterators/.  This can lead to performance issues and event `StackOverflow` for large trees."}}