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},
Leetcode 206 Reverse Linked List and 92 Reverse Linked List II Leetcode 206 Reverse Linked List The problem description is as follow: Reverse a singly linked list: /** * Definition
Leetcode 72 Edit Distance Check Edit Distance on GitHub The problem description is as follow: Given two words word1 and word2, find the minimum number of steps required to convert
Leetcode 87 Scramble String The problem description is as follow: Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
