{"push_id":3100412120,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"fb30f9aef968617c5e70b435aeff7a5c74ed8a84","before":"432ca34a239ae104b24913c004ba4a4695c91880","commits":[{"sha":"fb30f9aef968617c5e70b435aeff7a5c74ed8a84","author":{"name":"Aditya Gupta","email":"c44757238b7938e78ed11963a134b8d7f102ffba@gmail.com"},"message":"This is a program to determine whether two binary trees are flip equivalent. The trees are given by root nodes root1 and root2.\n\nFor a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.\r\n\r\nA binary tree X is flip equivalent to a binary tree Y if and only if we can make X equal to Y after some number of flip operations.","distinct":true,"url":"https://api.github.com/repos/contactaditya/Interview-Preparation/commits/fb30f9aef968617c5e70b435aeff7a5c74ed8a84"}]}
{"actor":{"display_login":"contactaditya"}}