1 Same Tree 2 Determine if Two Trees are Identical 3 Binary Tree Zigzag Level Order Traversal 4 Binary Tree Level Order Traversal 5 Cousins in Binary Tree 6 Balanced Binary Tree 7 Delete Leaves With a Given Value 8 Maximum Level Sum of a Binary Tree 9 Sum Root to Leaf Numbers 10 Root to leaf path sum 11 Path Sum II 12 Path Sum III 13 Smallest String Starting From Leaf 14 Populating Next Right Pointers in Each Node 15 Populating Next Right Pointers in Each Node II 16 Print all nodes that don't have sibling 17 Reverse Level Order Traversal 18 Insert a node in a BST 19 Convert Sorted Array to Binary Search Tree 20 Convert Sorted List to Binary Search Tree
1 Symmetric tree 2 Invert Binary Tree 3 Mirror Tree 4 Reverse odd levels of perfect binary tree 5 Odd even level difference 6 Ancestors in Binary Tree 7 Balance Binary Tree 8 Insert a node in a BST 9 Delete a node from BST 10 Left View of Binary Tree 11 Right View of Binary Tree 12 Boundary Traversal of binary tree 13 Diameter of a Binary Tree 14 Validate Binary Search Tree 15 Maximum sum bst in binary tree 16 Sum Tree 17 Paths from root with a specified sum 18 Binary Tree Maximum Path Sum 19 Longest Uni-value Path 20 Construct binary tree from preorder and inorder traversal 21 Construct binary tree from inorder and postorder traversal 22 Binary search tree to greater sum tree 23 Flatten binary tree to linked list 24 lowest common ancestor of a binary search tree