python-algorithms/leetcode/src/binary_trees/README.md at main · david-legend/python-algorithms · GitHub

Leetcode Binary Tree Questions

E - Easy, M - Medium , H - Hard,

E Binary Tree Inorder Traversal
E Same Tree
E Symmetric Tree
E Maximum Depth of Binary Tree
E Convert Sorted Array to Binary Search Tree
E Balanced Binary Tree
E Minimum Depth of Binary Tree
E Path Sum
E Binary Tree Preorder Traversal
E Binary Tree Postorder Traversal
E Invert Binary Tree
E Lowest Common Ancestor of a Binary Search Tree
E Binary Tree Paths
E Sum of Left Leaves
E Find Mode in Binary Search Tree
E Minimum Absolute Difference in BST
E Diameter of Binary Tree
E Binary Tree Tilt
E Subtree of Another Tree
E Construct String from Binary Tree
E Merge Two Binary Trees
E Average of Levels in Binary Tree
E Two Sum IV - Input is a BST
E Second Minimum Node In a Binary Tree
E Minimum Distance Between BST Nodes

M Unique Binary Search Trees II
M Unique Binary Search Trees
M Validate Binary Search Tree
M Recover Binary Search Tree
M Binary Tree Level Order Traversal
M Binary Tree Zigzag Level Order Traversal
M Construct Binary Tree from Preorder and Inorder Traversal
M Construct Binary Tree from Inorder and Postorder Traversal
M Binary Tree Level Order Traversal II
M Path Sum II
M Flatten Binary Tree to Linked List
M Populating Next Right Pointers in Each Node
M Populating Next Right Pointers in Each Node II
M Sum Root to Leaf Numbers
M Binary Search Tree Iterator
M Binary Tree Right Side View
M Count Complete Tree Nodes
M Kth Smallest Element in a BST
M Lowest Common Ancestor of a Binary Tree
M House Robber III
M Path Sum III
M Serialize and Deserialize BST
M Delete Node in a BST
M Most Frequent Subtree Sum
M Find Bottom Left Tree Value
M Find Largest Value in Each Tree Row
M Convert BST to Greater Tree
M Add One Row to Tree
M Find Duplicate Subtrees
M Maximum Binary Tree
M Print Binary Tree
M Maximum Width of Binary Tree
M Trim a Binary Search Tree
M Longest Univalue Path
M All Nodes Distance K in Binary Tree
M Smallest String Starting From Leaf
M Maximum Binary Tree II
M Construct Binary Search Tree from Preorder Traversal