Traversal problems

23 Traversal DSA practice problems on CampusCode, each with statement, examples and constraints.

• 298. Find the Length of a Linked List Easy Linked List
• 310. Count Occurrences of a Value in Linked List Easy Linked List
• 311. Convert Linked List to Array Easy Linked List
• 318. Find Sum of All Nodes in Linked List Easy Linked List
• 329. Max Element in Linked List Easy Linked List
• 330. Min Element in Linked List Easy Linked List
• 334. Doubly Linked List — Reverse Traversal Easy Linked List
• 342. Delete Last Occurrence of a Given Value Easy Linked List
• 351. Find the Fractional Node (Every Kth Node) Easy Linked List
• 352. Return Kth Node from Beginning Easy Linked List
• 374. Check if Linked List is Sorted Medium Linked List
• 835. Inorder Traversal of Binary Tree Easy Trees
• 836. Preorder Traversal of Binary Tree Easy Trees
• 837. Postorder Traversal of Binary Tree Easy Trees
• 838. Level Order Traversal (BFS) Easy Trees
• 852. Left View of Binary Tree Easy Trees
• 853. Right View of Binary Tree Easy Trees
• 856. Zigzag Level Order Traversal Easy Trees
• 857. Boundary Traversal of Binary Tree Easy Trees
• 874. Iterative Inorder Traversal Using Stack Easy Trees
• 878. Find Minimum in BST Easy Trees
• 879. Find Maximum in BST Easy Trees
• 911. Iterative Postorder Using One Stack Medium Trees