getSuccessor and getPredecessor in class RedBlackTree are redundant with BinaryTree

zrwusa / data-structure-typed

Javascript Data Structure & TypeScript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree, AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack.

https://data-structure-typed-docs.vercel.app

MIT License

114 stars 8 forks source link

getSuccessor and getPredecessor in class RedBlackTree are redundant with BinaryTree #42

Closed zrwusa closed 7 months ago

zrwusa commented 10 months ago

Describe the solution you'd like getSuccessor and getPredecessor in class RedBlackTree are redundant with BinaryTree

zrwusa commented 7 months ago

Re-implemented the Red-Black Tree, and this issue has been resolved in version 1.50.9 and later.