<div>class Heap{</div> <div>public static void main(String[] args){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> BinarySearchTree bsT = new BinarySearchTree();</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.insertBST(3);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.insertBST(15);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.insertBST(56);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.insertBST(7);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.insertBST(33);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.insertBST(45);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.insertBST(20);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.insertBST(19);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> </div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> System.out.printf("\n Binary Tree >>>>");</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> bsT.printBST();</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span> </div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}}</div> <div><br></div> <div>class TreeNode{</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>int data;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>TreeNode left;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>TreeNode right;</div> <div>}</div> <div><br></div> <div>class BinarySearchTree{</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>private TreeNode root = new TreeNode();</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>public TreeNode insertKey(TreeNode root, int x){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>TreeNode p = root;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>TreeNode newNode = new TreeNode();</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>newNode.data = x;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>newNode.left = null;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>newNode.right = null;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>if(p == null)</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>return newNode;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>else if (newNode.data > p.data){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>p.left=insertKey(p.left,x);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>return p;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>else if (newNode.data < p.data){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>p.right=insertKey(p.right,x);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>return p;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>else return p;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>public void insertBST(int x){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>root = insertKey(root,x);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>public TreeNode searchBST(int x){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>TreeNode p = root;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>while(p != null){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>if(x < p.data) </div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>p = p.left;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>else if (x > p.data) </div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>p = p.right;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>else return p;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>return p;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>public void inorder(TreeNode root){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>if( root != null){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>inorder(root.left);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>System.out.printf(" %d", root.data);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>inorder(root.right);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}<span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>public void printBST(){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>inorder(root);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>System.out.println();</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div>}</div> <div><br></div> <div>교재에 있는걸 변형해서 위처럼 구현해놨는데</div> <div><br></div> <div>저는 0을 입력하지 않았는데 자꾸 결과에 0이 포함되서 정렬이 되어버리네요... 어떻게 해야하나요;;</div>
댓글 분란 또는 분쟁 때문에 전체 댓글이 블라인드 처리되었습니다.