Problems # Status Problem Level Completes Likes 36 Binary Tree - Preorder Traversal - Non Recursive Approach Beginner % 0 37 Binary Tree-Inorder Traversal - Non Recursive Approach Beginner % 0 38 Delete the Binary Tree Beginner % 0 39 Search the Element in a binary tree - With and Without Recursion Beginner % 0 40 Tree Traversals Beginner % 0 41 Find the Size of a Binary Tree without Recursion Beginner % 0 42 Dynamic Programming — Longest Palindromic Subsequence Hard % 0 43 Dynamic Programming - Maximum Product Cutting Problem. Medium % 0 44 Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number Hard % 0 45 Dynamic Programming - Longest Common Substring Medium % 0 Binary Tree - Preorder Traversal - Non Recursive Approach Binary Tree-Inorder Traversal - Non Recursive Approach Delete the Binary Tree Search the Element in a binary tree - With and Without Recursion Tree Traversals Find the Size of a Binary Tree without Recursion Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Maximum Product Cutting Problem. Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number Dynamic Programming - Longest Common Substring 1 2