Designed to function as a textbook or as a professional reference, "Fundamentals of Data Structures in C" provides in-depth coverage of all aspects of data structure implementation in ANSI C. The book goes beyond the standard fare of stacks, queues, and lists to offer such features as afull chapter on search structures and a discussion of advanced tree structures. Recent data structure innovations rarelv found in other texts are presented, including Fibonacci Heaps, Splay Trees, Red-Black Trees, 2-3 Trees, 2-3-4 Trees, Leftist Trees, Binokcal Heaps, Min-Max Heaps, and Deaps.
OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.
Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.
Find this site helpful? Tell a friend about us.
We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.
Your purchases help us maintain our catalog and keep our servers humming without ads.
Thank you for supporting OpenCourser.