# Status Problem video Level Completes Likes 98 Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Hard % 0 97 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 89 Find Smallest Subarray Exceeding a Target Sum Medium % 0 84 Elements in an Array Occurring More Than N/K Times Hard % 0 82 Find Nodes at Distance X from a Given Node in a Tree Hard % 0 45 Print a path from Root to Node in Binary Tree Medium % 0 40 In a Binary Tree, Create Linked Lists of all the nodes at each depth Hard % 0 39 Level Order Traversal, Print each level in separate line Medium % 0 36 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Construct Binary Search Tree from a given Preorder Traversal using Recursion Find Smallest Subarray Exceeding a Target Sum Elements in an Array Occurring More Than N/K Times Find Nodes at Distance X from a Given Node in a Tree Print a path from Root to Node in Binary Tree In a Binary Tree, Create Linked Lists of all the nodes at each depth Level Order Traversal, Print each level in separate line Find the Maximum Depth OR Height of a Binary Tree 1 2 3 4
