Given a Binary Tree and a positive integer k, print all nodes that are distance k from a leaf node.
Here the meaning of distance k from a leaf means k levels higher than a
Binary Tree
Check Binary Tree is Binary Search Tree or not
To search Binary Search Tree
First lets understand characteristics of BST
• The left subtree of a node contains only nodes with keys less than the node’s key.
• The right subtree of a node
… Read More First lets understand characteristics of BST
• The left subtree of a node contains only nodes with keys less than the node’s key.
• The right subtree of a node
Print vertical sum of all the axis in the given binary tree
Print Vertical Sum of all the axis in the given binary Tree.
Most of times in written test , you will encounter this very good question.
given a binary tree.
(most of times a complete
Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.
Generate Postorder traversal of Tree from Inorder and Preorder traversal of tree without generating Tree.
Input:
In-order traversal in[] = {4, 2, 5, 1, 3, 6}
Pre-order traversal pre[] = {1, 2, 4, 5, 3, Binary Tree in Java
Implementation of Binary Tree in Java Language.
import java.io.*;
import java.util.*;
class Node
{
public int iData; // data item (key)
public double dData; // data item
public Node leftChild; // this node's left child
BFS (Breath First Search)
In graph theory, breadth-first search (BFS) is a strategy for searching in a graph when search is limited to essentially two operations: (a) visit and inspect a node of a graph; (b) gain access to
DFS (Depth First Search)
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores