## Search the Element in a binary tree – With and Without Recursion

Objective: Given a binary tree and a given number x, Write an recursive algorithm to search the element in the tree. This is one of the very basic problems of tree. If you are...

Skip to content
# Category: 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.

##
Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number

##
Diameter Of a Binary Tree

##
Find the Deepest Node in a Binary Tree.

##
Print All The Full Nodes in a Binary Tree

##
Print the Bottom View of the Binary Tree.

##
AVL Tree – Insertion

##
Construct a binary tree from given Inorder and Level Order Traversal

@tutorialhorizon

Objective: Given a binary tree and a given number x, Write an recursive algorithm to search the element in the tree. This is one of the very basic problems of tree. If you are...

There are multiple ways to in which you can traverse a tree. In this article we will see these traversals in detail. If you are new to trees then I would recommend that you...

Objective: Given a binary tree, Write an non-recursive algorithm to find the size of the tree. Note : Size of the tree is numÂber of nodes in the tree Approach: In our earlier post (link)...

Breadth-First Search ( or Traversal) also know as Level Order Traversal. What is Breadth First Search: Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at...

Objective: – Given a binary tree, Find the deepest left node in it. Approach: This approach is very similar to “Find the Deepest Node in a Binary Tree” with little modification. Take two global...

Objective: – Given a binary tree , Find the max element in it. Example: Approach: Use Recursion. Max will the Max(root, max element in left subtree, max element in rightsubtree) Recursively solve for max...

Objective: – Given a binary tree with three pointers left, right and nextSibling). Write the program to provide the nextsibling pointers. This problem can also be referred as “Populating Next Right Pointers in Each...

Objective: – Given two binary trees check if they are mirror image of each other. Example: Approach:

Objective: – Given a binary tree and X, write an algorithm to Print all the paths starting from root so that sum of all the nodes in path equals to a given number. Example:

Objective: – Given a binary tree, write an algorithm to find the diameter of the tree. What is Diameter Of a Tree: Diameter of tree is defined as A longest path or route between...

Objective: – Given a binary tree, write an algorithm to Find the deepest node in it. Approach: Take two global variable as “deepestlevel” and “value“. starting with level=0, Do the inorder traversal and whenever...

Objective: Given a binary tree, print all nodes will are full nodes. Full Nodes: Nodes Which has both the children, left and right are called Full Nodes Approach: quite simple Solution. Do the any...

ObjecÂtive: – Given a binary tree, print it in Bottom View of it. What is Bottom View: Bottom view means when you look the tree from the bottom the nodes you will see will be...

What is AVL Tree : AVL tree is widely known as self-balancing binary search tree. It is named after its creator (Georgy Adelson-Velsky and Landis’ tree). In AVL Tree, the heights of child subtrees...

Objective: – Given a inorder and level order traversal, construct a binary tree from that. Input: Inorder and level order traversal Approach: int[] inOrder = { 4, 2, 5, 1, 6, 3, 7 };...

%d bloggers like this: