Created
May 13, 2018 06:18
-
-
Save tratitude/3fdd194e0e9d6d76be021aa7d8145596 to your computer and use it in GitHub Desktop.
LeetCode-play ground
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
/** | |
* Definition for a binary tree node. | |
* struct TreeNode { | |
* int val; | |
* TreeNode *left; | |
* TreeNode *right; | |
* TreeNode(int x) : val(x), left(NULL), right(NULL) {} | |
* }; | |
*/ | |
string treeNodeToString(TreeNode* root) { | |
if (root == nullptr) { | |
return "[]"; | |
} | |
string output = ""; | |
queue<TreeNode*> q; | |
q.push(root); | |
while(!q.empty()) { | |
TreeNode* node = q.front(); | |
q.pop(); | |
if (node == nullptr) { | |
output += "null, "; | |
continue; | |
} | |
output += to_string(node->val) + ", "; | |
q.push(node->left); | |
q.push(node->right); | |
} | |
return "[" + output.substr(0, output.length() - 2) + "]"; | |
} | |
void trimLeftTrailingSpaces(string &input) { | |
input.erase(input.begin(), find_if(input.begin(), input.end(), [](int ch) { | |
return !isspace(ch); | |
})); | |
} | |
void trimRightTrailingSpaces(string &input) { | |
input.erase(find_if(input.rbegin(), input.rend(), [](int ch) { | |
return !isspace(ch); | |
}).base(), input.end()); | |
} | |
TreeNode* stringToTreeNode(string input) { | |
trimLeftTrailingSpaces(input); | |
trimRightTrailingSpaces(input); | |
input = input.substr(1, input.length() - 2); | |
if (!input.size()) { | |
return nullptr; | |
} | |
string item; | |
stringstream ss; | |
ss.str(input); | |
getline(ss, item, ','); | |
TreeNode* root = new TreeNode(stoi(item)); | |
queue<TreeNode*> nodeQueue; | |
nodeQueue.push(root); | |
while (true) { | |
TreeNode* node = nodeQueue.front(); | |
nodeQueue.pop(); | |
if (!getline(ss, item, ',')) { | |
break; | |
} | |
trimLeftTrailingSpaces(item); | |
if (item != "null") { | |
int leftNumber = stoi(item); | |
node->left = new TreeNode(leftNumber); | |
nodeQueue.push(node->left); | |
} | |
if (!getline(ss, item, ',')) { | |
break; | |
} | |
trimLeftTrailingSpaces(item); | |
if (item != "null") { | |
int rightNumber = stoi(item); | |
node->right = new TreeNode(rightNumber); | |
nodeQueue.push(node->right); | |
} | |
} | |
return root; | |
} | |
void prettyPrintTree(TreeNode* node, string prefix = "", bool isLeft = true) { | |
if (node == nullptr) { | |
cout << "Empty tree"; | |
return; | |
} | |
if(node->right) { | |
prettyPrintTree(node->right, prefix + (isLeft ? "│ " : " "), false); | |
} | |
cout << prefix + (isLeft ? "└── " : "┌── ") + to_string(node->val) + "\n"; | |
if (node->left) { | |
prettyPrintTree(node->left, prefix + (isLeft ? " " : "│ "), true); | |
} | |
} | |
int main() { | |
string line; | |
while (getline(cin, line)) { | |
TreeNode* root = stringToTreeNode(line); | |
prettyPrintTree(root); | |
} | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment