Name

Institute

MTA VN

Overall Coding Score: 130

Monthly Coding Score: 0

Weekly Coding Score: 0

- Sum of Leaf Nodes at Min Level
- Kth largest element in BST
- Depth of node
- Leaf at same level
- Longest consecutive sequence in Binary tree
- Print BST elements in given range
- Lowest Common Ancestor in a BST
- Delete nodes greater than k
- Sum of Left Leaf Nodes
- Closest Neighbor in BST
- Sum of the Longest Bloodline of a Tree (Sum of nodes on the longest path from root to leaf node)
- Ancestors in Binary Tree
- Diameter of Binary Tree
- Maximum Width of Tree
- Two Mirror Trees

- Foldable Binary Tree
- Duplicate subtree in Binary Tree
- K-Sum Paths
- Node at distance
- Mirror of a given node
- Pairs violating BST property
- Maximum path sum from any node
- Duplicate Subtrees
- Construct Tree from Preorder Traversal
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Construct expression tree
- Binary Tree to CDLL
- Count BST nodes that lie in a given range
- Find the Closest Element in BST
- Number of root to leaf paths
- Clone a Binary Tree
- Extreme nodes in alternate order
- Check if subtree
- Make Binary Tree From Linked List
- Maximum difference between node and its ancestor
- Min distance between two given nodes of a Binary Tree
- Diagonal Traversal of Binary Tree
- Connect Nodes at Same Level
- Add all greater values to every node in a BST
- Tree from Postorder and Inorder
- Check for BST