Question d’entretien chez Microsoft
convert binary search tree to sorted doubly linked list.
Réponse à la question d'entretien
Utilisateur anonyme
31 mars 2017
TreeNode inordertoBST(TreeNode root) { If(root==null) Return null; Stack<div>stack = new Stack<div>(); TreeNode n=root; While(n!=null) { stack.push(n); n=n.left; } TreeNode head, prev; boolean isHead=true; while(stack.empty()==false) { n=stack.pop(); if(isHead) { n.left=null; head=n; isHead=false; } Else { n.left=prev; prev.right=n; prev=n; } n=n.right; if(n==null) { prev.right=null; break; } While(n!=null) { stack.push(n); n=n.left; } } return head; }</div></div>