October 2004
Beginner to intermediate
512 pages
9h 47m
English
8.7 Binary Tree Representation
8.9 Traversal of a Binary Tree
8.10 Conversion of Expression into Postfix
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 ...
Read now
Unlock full access