No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
Hi, I am not able to understand DSW ALgirthm Its process of creating backbone or vine and creating balanced Tree. By rotation of Vine(BackBone) what is being said I couldnt Understand. Read few articles but Couldnt Understand Much. Can some one explain me about DSW Algorithm. And Also I tried … 
|
|
|
public static void nonRecursiveInorder(Node node) { Stack<Node> st=new Stack(); st.push(node); Node temp; while(!st.isEmpty()) { temp=st.peek(); if(temp.left!=null && temp.left.visited==false) st.push(temp.left); else { if(temp.left==null && temp.right!=null && temp.right.visited==false) { System.out.print(" "+temp.value); temp.visited=true; st.pop(); st.push(temp.right); } else { if(temp.left!=null && temp.left.visited==true && temp.right!=null && temp.right.visited==false) { System.out.print(" "+temp.value); temp.visited=true; st.pop(); st.push(temp.right); } else …
|