{"gist":{"created_at":"2011-12-27T23:05:11Z","user":{"login":"stesh","id":175897,"url":"https://api.github.com/users/stesh","avatar_url":"https://secure.gravatar.com/avatar/3a720ce483cf66136f2d673987d56346?d=https://a248.e.akamai.net/assets.github.com%2Fimages%2Fgravatars%2Fgravatar-140.png","gravatar_id":"3a720ce483cf66136f2d673987d56346"},"updated_at":"2011-12-27T23:05:11Z","id":"1525428","public":true,"html_url":"https://gist.github.com/1525428","files":{},"description":"Iterative postorder traversal of a binary tree","url":"https://api.github.com/gists/1525428","git_push_url":"git@gist.github.com:1525428.git","comments":0,"git_pull_url":"git://gist.github.com/1525428.git"},"action":"create"}