Introduction to Data Structures in C

Chapter 8

Trees

Chapter Outline

8.1 Introduction

8.2 Basic Terms

8.3 Binary Trees

8.4 Complete Binary Tree

8.5 Strictly Binary Tree

8.6 Extended Binary Tree

8.7 Binary Tree Representation

8.8 Operation on Binary Tree

8.9 Traversal of a Binary Tree

8.10 Conversion of Expression into Postfix

8.11 Binary Search Tree

8.12 Threaded Binary Tree

8.13 Height-balanced Tree

8.14 B-Tree (Balanced Multi-way Tree)

8.15 B-Tree of Order 5

8.16 B⁺ Tree

8.1 INTRODUCTION

In the previous chapters, we have studied various data structures such as arrays, stacks, queues and linked list. All these are linear data structures. In these data structures the elements are arranged in a linear manner, i.e. one after another. Tree is an equally useful data structure of ...