Leetcode 99 Recover Binary Search Tree The problem description is as follow: Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its
Leetcode 25 Reverse Nodes in k-Group Edit Reverse Nodes in k-Group on GitHub The problem description is as follow: Given a linked list, reverse the nodes of a linked list
Leetcode 94 Binary Tree Inorder Traversal The problem description is as follow: Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},
Leetcode 144 Binary Tree Preorder Traversal The problem description is as follow: Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},
Leetcode 145 Binary Tree Postorder Traversal The problem description is as follow: Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},
