Back to Results
First PageMeta Content
Data management / Computing / Binary search tree / Red–black tree / 2-3-4 tree / AVL tree / Tree / Self-balancing binary search tree / R-tree / Binary trees / Graph theory / B-tree


Left-leaning Red-Black Trees Robert Sedgewick Department of Computer Science
Add to Reading List

Document Date: 2008-09-14 13:43:43

Open Document

File Size: 800,71 KB

Share Result on Facebook

City

Ann Arbor / Chesire / /

Company

Bayer / Xerox / MIT Press / /

IndustryTerm

typical search / elementary binary search tree / classic algorithms / symbol-table applications / balanced search trees / maintenance algorithms / expected worstcase search cost / search trees / worst-case search time / typical applications / search path / range search / computational infrastructure / symbol-table algorithm / typical symbol-table applications / red-black tree algorithms / worst-case search cost / search cost / typical large-scale applications / balanced-tree algorithms / software libraries / anced-tree algorithms / /

MarketIndex

Tree B / /

OperatingSystem

Unix / BSD / /

Organization

MIT / Red-Black Trees Robert Sedgewick Department of Computer Science Princeton University Princeton / /

Person

Node insert / Node delete(Node / Node insert(Node / Kevin Wayne / Node delete / /

Position

Acknowledgement The author / /

ProgrammingLanguage

Java / Python / C++ / /

ProvinceOrState

New Jersey / Connecticut / /

Technology

red-black tree algorithms / An algorithm / anced-tree algorithms / maintenance algorithms / Java / balanced-tree algorithms / two classic algorithms / private Key / dom / symbol-table algorithm / cmp / BST algorithms / red-black BST algorithms / /

SocialTag