Page 215 - DCAP201_FUNDAMENTALS_OF_DATA_STRUCTURES

Fundamentals of Data Structures

Notes 3. What is a binary tree? Discuss the structure of a binary tree with example.
4. Discuss the process of creating binary tree with example.
5. Illustrate the representation of binary trees using arrays.
6. Describe Linked representation of binary trees with example.

7. What are the different ways of tree traversal? Discuss.
8. In PRE-ORDER, we visit the current node first, then we visit its left sub-tree and then its
right sub-tree. Comment.

9. Illustrate the steps used for traversing a non-empty binary tree in post-order.
10. Describe the concept of non-recursive traversal using a Threaded Binary Tree.

Answers: Self Assessment

1. Tree 2. Node
3. leaf nodes 4. Root node

5. subtree 6. Depth
7. Binary tree 8. Address
9. NULL 10. null pointers
11. tree traversal 12. Recursive
13. PRE-ORDER 14. Threaded

15. current

12.7 Further Readings

Books Davidson, 2004, Data Structures (Principles and Fundamentals), Dreamtech Press
Karthikeyan, Fundamentals, Data Structures and Problem Solving, PHI Learning
Pvt. Ltd.
Samir Kumar Bandyopadhyay, 2009, Data Structures using C, Pearson Education
India

Sartaj Sahni, 1976, Fundamentals of Data Structures, Computer Science Press

Online links http://ideainfo.8m.com/
http://claymore.engineer.gvsu.edu/~jackh/books/analysis/pdf/trees.pdf

http://www.cs.auckland.ac.nz/~jmor159/PLDS210/trees.html
http://www.i-programmer.info/babbages-bag/477-trees.html

208 LOVELY PROFESSIONAL UNIVERSITY