This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//A simple and efficient program that check's if a binary tree is symmetrical (i.e) if one side is the mirror reflection of another . | |
class Tree { | |
public boolean checkSymmetric(TreeNode root) { | |
//An helper function that keeps track of my left and right subtrees. | |
return help( root, root); | |
} | |
public static boolean help(TreeNode left,TreeNode right) | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
The Research questions we are tyring to address : Can the correlation btwn tags be analyzed from a novel perspective , can we sucessfully model the | |
correlation between tags using a new approach. | |
We contructed a simple comparision interface to study and analyze two different perspectives on the same problem. | |
The left side of the tool shows us the visualization of a traditional text min alg, used to find highly correlated tags and their relation | |
with others.Implemented using the K means on the value of cor- coeff , | |
Right side shows a unique algorithm that we came up , it shows the co-relation between tags based on user interaction . COnstructed by | |
parsing the entire data set and finding number of users who haveactively participated on two or more tags. |