Below program will check if root’s data is greater than k then return its left node.
1 2 3 4 5 6 7 8 9 10 11 12 | public Node deleteNode(Node root,int x) { if(root==null) return null; root.left=deleteNode(root.left,x); root.right=deleteNode(root.right,x); if(root.data>=x) { return root.left; } return root; } |
If you like this question & answer and want to contribute, then write your question & answer and email to freewebmentor[@]gmail.com. Your question and answer will appear on FreeWebMentor.com and help other developers.
