LC 130. Surrounded Regions
https://leetcode.com/problems/surrounded-regions/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
int dr[4] = {-1, 1, 0, 0};
int dc[4] = {0, 0,
Top Interview 150
LC 230. Kth Smallest Element in a BST
https://leetcode.com/problems/kth-smallest-element-in-a-bst/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
int c = 0;
int ans = 0;
int kthSmallest(TreeNode* root, int k)
LC 530. Minimum Absolute Difference in BST
https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
int ans;
pair<int, int> dfs(TreeNode *cur) {
if
LC 103. Binary Tree Zigzag Level Order Traversal
https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
if
LC 199. Binary Tree Right Side View
https://leetcode.com/problems/binary-tree-right-side-view/description/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
if (root == NULL) return