Is there any text-book implementation of self-balancing binary search trees such as AVL or red-black in Mathematica?

  • 1
    $\begingroup$ The Mathematica Coobook has an implementation of a red-black tree, take a look here. $\endgroup$ – C. E. May 17 '15 at 23:08
  • $\begingroup$ The Mathematica Cookbook's description of deletion from red-black trees is completely wrong. $\endgroup$ – J D Mar 31 '17 at 20:15

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.