Tree Walks and Traversals

Hi! If you are thinking where have you arrived and have no clue of whats going on then visit this page.

Here is the lecture on tree walks and traversals by Prof Naveen Garg.

1. Recursive and Iterative Preorder Traversal of a Binary Tree

2. Recursive and Iterative Inorder traversal of a Binary Tree

3. Recursive and Iterative Postorder traversal of a Binary Tree

4. Program to find whether two binary trees are identical or not

5. Count the number of leaves, non-leaf nodes and nodes having one child in a Binary Tree

6. Level order and reverse level order traversal of a Binary Tree

7. Program for finding the size and height of a Binary Tree

8. Code for searching an element in a Binary Tree

9. Code for finding the maximum element of a Binary Tree

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s