{"action":"opened","issue":{"url":"https://api.github.com/repos/rishabh3112/Binary-Trees/issues/16","repository_url":"https://api.github.com/repos/rishabh3112/Binary-Trees","labels_url":"https://api.github.com/repos/rishabh3112/Binary-Trees/issues/16/labels{/name}","comments_url":"https://api.github.com/repos/rishabh3112/Binary-Trees/issues/16/comments","events_url":"https://api.github.com/repos/rishabh3112/Binary-Trees/issues/16/events","html_url":"https://github.com/rishabh3112/Binary-Trees/issues/16","id":339115557,"node_id":"MDU6SXNzdWUzMzkxMTU1NTc=","number":16,"title":"Level wise linkedlist","user":{"login":"rishabh3112","id":15812317,"node_id":"MDQ6VXNlcjE1ODEyMzE3","avatar_url":"https://avatars3.githubusercontent.com/u/15812317?v=4","gravatar_id":"","url":"https://api.github.com/users/rishabh3112","html_url":"https://github.com/rishabh3112","followers_url":"https://api.github.com/users/rishabh3112/followers","following_url":"https://api.github.com/users/rishabh3112/following{/other_user}","gists_url":"https://api.github.com/users/rishabh3112/gists{/gist_id}","starred_url":"https://api.github.com/users/rishabh3112/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/rishabh3112/subscriptions","organizations_url":"https://api.github.com/users/rishabh3112/orgs","repos_url":"https://api.github.com/users/rishabh3112/repos","events_url":"https://api.github.com/users/rishabh3112/events{/privacy}","received_events_url":"https://api.github.com/users/rishabh3112/received_events","type":"User","site_admin":false},"labels":[{"id":983309596,"node_id":"MDU6TGFiZWw5ODMzMDk1OTY=","url":"https://api.github.com/repos/rishabh3112/Binary-Trees/labels/problem","name":"problem","color":"5319e7","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-07-07T04:12:48Z","updated_at":"2018-07-07T04:12:48Z","closed_at":null,"author_association":"OWNER","body":"### Question\r\nGiven a binary tree, write code to create a separate linked list for each level. You need to return the array which contains head of each level linked list.\r\n\r\n**Input format**\r\n```\r\nElements in level order form (separated by space).\r\nIf any node does not have left or right child, take -1 in its place.\r\n```\r\n**Output format**\r\n```\r\nEach level linked list is printed in new line (elements separated by space).\r\n```"}}
{"actor":{"display_login":"rishabh3112"}}