Skip to main content

DataStructure Simplyfied

 Array

[5][3][4][10] ->values

[0][1][2][3] ->index

Linked List

-Head

-Tail

-Middle


/*

[10|pointer]->[20|pointer]->[30|pointer]


*/



Stack

-Push

-Pop

-Top

-Peak


/*

[ 20 ] <--Push Or Pop From One Side

[ 15 ]

[ 10 ]

[ 5  ]

*/



Que

-Push

-Enque

-Deque


/*

Pop From Another Side <--[5][10][15][20] <--Push from One Side

*/


Tree

-Root

-Left

-Right


/*

   root

/    \

       /      \

     Left Right

    / \           \

   /     \            \

Left right     Right


Traversal

1.PreOrder(Root,Left,Right)


Regressive(root):

if(root!=null)

print(root.data)

Regressive(root.left)

Regressive(root.right)



2.InOrder(Left,Root,Right)


Regressive(root):

if(root!=null)

Regressive(root.left)

print(root.data)

Regressive(root.right)



3.PostOrder(Left,Right,Root)


Regressive(root):

if(root!=null)

Regressive(root.left)

Regressive(root.right)

print(root.data)

--------Types


Binary Tree

1.Each Node Contain Pointer Of Left And Right Child

2.parent of node called root

3.child of node is known as child

4.node not have any child known as leaf

    root

    /  \

   /    \

left right

        / \       / \

       /   \   left  right

    left   right


Binary Search Tree

1.Right Of Tree Node Values Must Grater value of compare to Root.

2.Left Of Tree Node Values Must Less  value of compare to Root.

AVL Tree

1.Self Balancing Tree

2.Must Left And Right tree Height Difference is -1,0,1



*/


Graph

-Node

-Path

1--------2

/    \ 

       /            \

      4------5-------3


Comments

Post a Comment

Popular posts from this blog

Run Length Encoding | Programming In Java

  Given a string, Your task is to complete the function   encode   that returns the   run-length encoded  string for the given string. eg  if the input string is “wwwwaaadexxxxxx”, then the function should return “w4a3d1e1x6″. You are required to complete the function  encode  that takes only one argument the string which is to be encoded and returns the encoded string. Example 1: Input: str = aaaabbbccc Output: a4b3c3 Explanation: a repeated 4 times consecutively b 3 times, c also 3 times. Example 2: Input: str = abbbcdddd Output: a1b3c1d4 Your Task: Complete the function  encode()  which takes a character array as an input parameter and returns the encoded string. Expected Time Complexity:  O(N), N = length of a given string. Expected Auxiliary Space:  O(1) Constraints: 1<=length of str<=100 Solution: import java.util.*;   class RLEncoding {    public static void main(String[] args)  ...
Post a Comment
Read more

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method
Post a Comment
Read more

Height Of Tree-Using Java Programming

  class node{ int data; node left; node right; node( int data){ this .data=data; } } class treeHeight{ node root; treeHeight(){ root= null ; } public static void main( String [] args){ treeHeight t=new treeHeight(); t.insert( 15 ); t.insert( 20 ); t.insert( 10 ); t.insert( 5 ); t.insert( 2 ); System.out.println(t.height(t.root)); } public void insert( int data){ root=addNode(root,data); } public node addNode(node root, int data){ if (root== null ){ return new node(data); } else if (root.data<data){ root.right=addNode(root.right,data); } else if (root.data>data){ root.left=addNode(root.left,data); } else { return root; } return root; } /* 15,20,10,5 Regression Is Used To Divide a Hu...
Post a Comment
Read more