LeetCode/655_Print_Binary_Tree.cpp at master · itsyadavRajkumar/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;
#define ll long long


// * Definition for a binary tree node.
struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode() : val(0), left(nullptr), right(nullptr) {}
	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
	TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

class Solution {
public:
	vector<vector<string>> printTree(TreeNode* root) {
		vector<vector<string>> res;
	}
};

bool ispar(string s)
{
	stack<char>st;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == '(' || s[i] == '{' || s[i] == '[') {
			st.push(s[i]);
		} else if (st.empty()) {
			return false;
		} else if (s[i] == ')') {
			if (st.top() == '(')
				st.pop();
			else return false;
		} else if (s[i] == '}') {
			if (st.top() == '{')
				st.pop();
			else return false;
		} else if (s[i] == ']') {
			if (st.top() == '[')
				st.pop();
			else return false;
		}

	}
	if (st.empty())
		return true;
	else
		return false;
}

};

int main() {

	return 0;
}