{"push_id":2675070039,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b9b9a53d66d987d45d45e34675b5b88702484c01","before":"1c495caa159a2998f743b7381e3cb5c1f1d7d6c3","commits":[{"sha":"b9b9a53d66d987d45d45e34675b5b88702484c01","author":{"name":"yashbansal231","email":"2888b65fa7abfcf27512c97e4f437eee519b2ac7@gmail.com"},"message":"Create diameter of tree\n\nThe diameter of a tree is the number of nodes on the longest path between two leaves in the tree.\r\nFirst line contains two integers, T and X, number of nodes in the tree and value of the root.\r\nNext  lines contain details of nodes.\r\nEach detail of node contains two lines. First lines contains a string and second line contains an integer, which denotes the path of the node and the value of the node respectively.\r\n\r\nString consists of only L or R. L denotes left child and R denotes right child.","distinct":true,"url":"https://api.github.com/repos/yashbansal231/trees/commits/b9b9a53d66d987d45d45e34675b5b88702484c01"}]}
{"actor":{"display_login":"yashbansal231"}}