Print All The Nodes Which are X distance from the Leaf Nodes
Objective: – Given Binary Tree, Print All The Nodes Which are X distance from the Leaf Nodes Example : Approach:
Category: Software Development Engineer (SDE)
Print All The Nodes Which are X distance from the Root
Objective: – Given Binary Tree, Print all the nodes which are X distance from the root Example : Appraoch:
Find the Distance between Two Nodes of a Binary Tree.
Objective: – Given nodes in a binary tree, find the distance between them. Example : Approach:
Find The Distance From Root To Given Node of a Binary Tree.
Objective: – Find The Distance From Root To Given Node of a binary tree. What does Distance means : It means number of edges between two nodes. Approach:
Print a path from Root to Node in Binary Tree
Objective: Given a Binary tree (Not binary Search Tree ), Print a path from root to a given node. Input: A binary tree, a node x Output: Path from root to a given node...
Inorder Successor in Binary Search Tree without Using Parent link
Objective: Given a Binary Search tree, find the inorder successor of a node. What is Inorder Successor: Inorder successor of a node is the next node in the inorder traversal of the tree. For...
Inorder Successor in Binary Search Tree Using Parent link
Algorithms – Inorder Successor in Binary Search Tree Using Parent link Objective: Given a Binary Search tree in which every node has a link to its parent, find the inorder successor of a node....
Inorder Successor in Binary Tree
Algorithms – Inorder Successor in Binary Tree Objective: Given a Binary tree (Not binary Search Tree ), find the inorder successor of a node. What is Inorder Successor: Inorder successor of a node is...
Sorted Array to Binary Search Tree of Minimal Height
Objective: Given a sorted array with unique elements, Create a binary search tree with minimal height. Why minimal height is important : We can do the linear scan to the array and make the...
In a Binary Tree, Create Linked Lists of all the nodes at each depth.
Objective: Given a Binary tree create Linked Lists of all the nodes at each depth , say if the tree has height k then create k linked lists. NOTE : This problem is very...
Level Order Traversal, Print each level in separate line.
Objective: Given a Binary tree , Print each level of a tree in separate line. NOTE : This problem is very similar ” Create Linked Lists of all the nodes at each depth “...
Find whether if a Given Binary Tree is Balanced?
Objective: Given a binary tree, Find whether if a Given Binary Tree is Balanced? What is balanced Tree: A balanced tree is a tree in which difference between heights of sub-trees of any node...
Find the Maximum Depth OR Height of a Binary Tree
Objective: Given a binary tree, find the height of it Input: A Binary Tree Output: Height of a binary tree Example: Approach:
Add two numbers represented by a linked list, Numbers are Stored in FORWARD order
This post is the extension of – Two numbers represented by a linked list, Number Stored in REVERSE order Objective: Two numbers represented by a linked listwhere each node contains single digit. The digits...
Add two numbers represented by a linked list, Numbers are Stored in REVERSE order
We have similar post – Two numbers represented by a linked list, Number Stored in FORWARD order Objective: Two numbers represented by a linked list where each node contains single digit. The digits are...