Skip to Main Content
Introducing Data Structures with Java
book

Introducing Data Structures with Java

by David Cousins
March 2013
Intermediate to advanced content levelIntermediate to advanced
416 pages
9h 41m
English
Pearson Education India
Content preview from Introducing Data Structures with Java

12

Binary Trees

  Trees

Contents

  • Binary tree structures
  • Search trees
  • Tree operations—build, search, traverse, delete items
  • A Tree class
  • Threaded trees
  • Expression trees
  • Heaps
12.1 INTRODUCTION

Each node in a singly linked list, stack or queue is linked to just one another, so that each points to its successor (in the doubly linked list an item points to its predecessor too). In the structure considered in this chapter, each node can be linked to one or more others. In the case of a ‘binary tree’, each node may be linked to a maximum of two others: A node has two links to its ‘left’ and ‘right’ children, it being their ‘parent’. Each child can ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures and Algorithms Using Java

Data Structures and Algorithms Using Java

William McAllister

Publisher Resources

ISBN: 9788131758649