A Simple Binary Search for Integers
BinarySearch(A[0..N-1], value)
{
low = 0
high = N - 1
while (low <= high) {
mid = low + ((high - low) / 2)
if (A[mid] > value)
Linked List V/S Binary Search Tree
Linked List :
Node(1) -> Node(2) -> Node(3) -> Node(4) -> Node(5) -> Node(6) -> Node(7)
- In linked list, the items are linked together through a single next pointer.
- Next Node’s Key Can be larger
Adobe Interview Questions 8 month Exp
Adobe Interview Questions Set 1
For Experience : 8 months
First Round :
Held on interview street Aptitude + Technical (standard pattern and questions)
Check Questions : Adobe C,Aptitude Written Questions Answers
Held on interview street Aptitude + Technical (standard pattern and questions)
Check Questions : Adobe C,Aptitude Written Questions Answers
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
Spanning Tree
In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree that includes all of the vertices and some or all of the edges of G.
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
Doubly linked list
In computer science, a doubly-linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous
Circular Linked List
In the last node of a list, the link field often contains a null reference, a special value used to indicate the lack of further nodes. A less common convention is to make it point
Singly linked list
In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference
… Read More