{"push_id":2149930552,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"af5506fe767bc338251dc12dc406b587f5c94eab","before":"f4960a349f45bd1a6ab8396628fbd52769f5347b","commits":[{"sha":"b614e92efed944dc6b16a939b7f634f3ceee2729","author":{"name":"LanLuUSC","email":"51d657449635bf46d105dadf364cbc1a64a18f76@usc.edu"},"message":"Is Binary Search Tree Or Not\n\nDetermine if a given binary tree is binary search tree.\n\nAssumptions\n\nThere are no duplicate keys in binary search tree.\nYou can assume the keys stored in the binary search tree can not be\nInteger.MIN_VALUE or Integer.MAX_VALUE.\nCorner Cases\n\nWhat if the binary tree is null? Return true in this case.","distinct":true,"url":"https://api.github.com/repos/LanLuUSC/AlgorithmPractise/commits/b614e92efed944dc6b16a939b7f634f3ceee2729"},{"sha":"af5506fe767bc338251dc12dc406b587f5c94eab","author":{"name":"LanLuUSC","email":"51d657449635bf46d105dadf364cbc1a64a18f76@usc.edu"},"message":"Check If Binary Tree Is Balanced\n\nCheck if a given binary tree is balanced. A balanced binary tree is one\nin which the depths of every node’s left and right subtree differ by at\nmost 1.\n\nExamples\n\n5\n\n/    \\\n\n3        8\n\n/   \\        \\\n\n1      4        11\n\nis balanced binary tree,\n\n5\n\n/\n\n3\n\n/   \\\n\n1      4\n\nis not balanced binary tree.\n\nCorner Cases\n\nWhat if the binary tree is null? Return true in this case.\nHow is the binary tree represented?\n\nWe use the level order traversal sequence with a special symbol \"#\"\ndenoting the null node.\n\nFor Example:\n\nThe sequence [1, 2, 3, #, #, 4] represents the following binary tree:\n\n1\n\n/   \\\n\n2     3\n\n/\n\n4","distinct":true,"url":"https://api.github.com/repos/LanLuUSC/AlgorithmPractise/commits/af5506fe767bc338251dc12dc406b587f5c94eab"}]}
{"actor":{"display_login":"LanLuUSC"}}