# Status Problem Level Completes Likes
1

Check If Given Undirected Graph is a tree

Medium % 0
2

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Medium % 0
3

Check the completeness of given binary tree | Set 1 - Using Node Count

Medium % 0
4

Count the number of nodes in a given binary tree

Beginner % 0
5

Convert Binary Tree into Threaded Binary Tree

Hard % 0
6

Double Threaded Binary Tree Complete Implementation

Hard % 0
7

Single Threaded Binary Tree Complete Implementation

Hard % 0
8

Introduction to Threaded Binary Tree

Medium % 0
9

Convert BST to Greater Sum Tree

Medium % 0
10

Get the Sum of all left leaves in a Binary tree

Beginner % 1
11

Convert binary tree to its Sum tree

Medium % 1
12

Binary Tree-Postorder Traversal - Non Recursive Approach

Beginner % 0
13

Binary Tree - Preorder Traversal - Non Recursive Approach

Beginner % 0
14

Binary Tree-Inorder Traversal - Non Recursive Approach

Beginner % 0
15

Delete the Binary Tree

Beginner % 0
16

Search the Element in a binary tree - With and Without Recursion

Beginner % 0
17

Tree Traversals

Beginner % 1
18

Find the Size of a Binary Tree without Recursion

Beginner % 0
19

Breadth-First Search/Traversal in a Binary Tree

Beginner % 0
20

Find the Deepest Left Node in a Binary Tree.

Medium % 0
21

Find the Max element in a Given Binary Tree

Beginner % 0
22

Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node

Hard % 0
23

Check If One Binary is Mirror Tree of another Binary Tree.

Beginner % 1
25

Diameter Of a Binary Tree

Hard % 1
26

Find the Deepest Node in a Binary Tree.

Medium % 1
29

AVL Tree - Insertion

Hard % 0
30

Construct a binary tree from given Inorder and Level Order Traversal

Hard % 0
31

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)

Hard % 0
32

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Hard % 0
35

Depth First Search/Traversal in Binary Tree

Beginner % 0

Check If Given Undirected Graph is a tree

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Check the completeness of given binary tree | Set 1 - Using Node Count

Count the number of nodes in a given binary tree

Convert Binary Tree into Threaded Binary Tree

Double Threaded Binary Tree Complete Implementation

Single Threaded Binary Tree Complete Implementation

Introduction to Threaded Binary Tree

Convert BST to Greater Sum Tree

Get the Sum of all left leaves in a Binary tree

Convert binary tree to its Sum tree

Binary Tree-Postorder Traversal - Non Recursive Approach

Binary Tree - Preorder Traversal - Non Recursive Approach

Binary Tree-Inorder Traversal - Non Recursive Approach

Delete the Binary Tree

Search the Element in a binary tree - With and Without Recursion

Tree Traversals

Find the Size of a Binary Tree without Recursion

Breadth-First Search/Traversal in a Binary Tree

Find the Deepest Left Node in a Binary Tree.

Find the Max element in a Given Binary Tree

Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node

Check If One Binary is Mirror Tree of another Binary Tree.

Diameter Of a Binary Tree

Find the Deepest Node in a Binary Tree.

AVL Tree - Insertion

Construct a binary tree from given Inorder and Level Order Traversal

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Depth First Search/Traversal in Binary Tree