Tree Traversal Algorithms — Study Resources & PYQs

Traversal algorithms for binary trees.

Estimated study time: 30 minutes

Study resources

Tree Traversals: Inorder, Preorder and Postorder - GeeksforGeeks (Article) — Explains inorder, preorder and postorder traversal algorithms with recursive code and worked examples on a sample tree.

Tree Traversal Algorithms previous year questions

Write algorithms for following: (i) Count the number of leaf nodes in a Binary tree. (ii) Set a node as right child of a Threaded Binary tree. (iii) Depth firs…

Taught in these subjects

Data Structures — CST3401 · Government College of Engineering and Technology, Jammu

Open on CachedInfo