# Status Problem video Level Completes Likes
93

Inorder Predecessor and Successor in Binary Search Tree

Hard % 0
79

Find the Distance between Two Nodes of a Binary Tree.

Hard % 0
78

Find The Distance From Root To Given Node of a Binary Tree.

Medium % 0
77

Construct a binary tree from given Inorder and Postorder Traversal

Hard % 0
74

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Hard % 0
73

Lowest Common Ancestor in a Binary Search Tree.

Medium % 0
72

Make a Binary Tree from Given Inorder and Preorder Traversal

Hard % 0
71

Given a binary tree, find out the maximum sum of value from root to each leaf.

Medium % 0
70

Reverse Alternate levels of a given Binary Tree.

Medium % 0
69

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Medium % 1
68

Given a binary tree, Convert it into its Mirror Tree

Beginner % 0
67

Given a binary tree, Print All the Nodes that don't have Siblings.

Beginner % 0
66

Convert a Sorted Doubly Linked List to Balanced BST.

Medium % 1
65

Given a binary tree, Find the Maximum Path Sum between Any Two Leaves

Medium % 0
62

In a Binary Tree, Check if Two nodes has the same parent or are siblings

Medium % 0
61

In a Binary Tree, Check if two nodes are Cousins

Medium % 0
60

Check if Two BST's are Identical

Beginner % 0
54

Find the maximum width of a binary tree

Medium % 0
51

Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern

Hard % 0
48

Determine whether given binary tree is binary search tree(BST) or not

Medium % 1
47

Find the Size of the Binary Tree

Beginner % 0
46

Given two binary trees, check if one binary tree is a subtree of another

Medium % 0
44

Inorder Successor in Binary Tree

Medium % 0
41

Sorted Array to Binary Search Tree of Minimal Height

Medium % 1

Inorder Predecessor and Successor in Binary Search Tree

Find the Distance between Two Nodes of a Binary Tree.

Find The Distance From Root To Given Node of a Binary Tree.

Construct a binary tree from given Inorder and Postorder Traversal

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Lowest Common Ancestor in a Binary Search Tree.

Make a Binary Tree from Given Inorder and Preorder Traversal

Given a binary tree, find out the maximum sum of value from root to each leaf.

Reverse Alternate levels of a given Binary Tree.

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Given a binary tree, Convert it into its Mirror Tree

Given a binary tree, Print All the Nodes that don't have Siblings.

Convert a Sorted Doubly Linked List to Balanced BST.

Given a binary tree, Find the Maximum Path Sum between Any Two Leaves

In a Binary Tree, Check if Two nodes has the same parent or are siblings

In a Binary Tree, Check if two nodes are Cousins

Check if Two BST's are Identical

Find the maximum width of a binary tree

Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern

Determine whether given binary tree is binary search tree(BST) or not

Find the Size of the Binary Tree

Given two binary trees, check if one binary tree is a subtree of another

Inorder Successor in Binary Tree

Sorted Array to Binary Search Tree of Minimal Height