LeetCode 145: Binary Tree Postorder Traversal
Return the postorder traversal of a binary tree using recursion or an iterative stack-based approach.
4 notes
Return the postorder traversal of a binary tree using recursion or an iterative stack-based approach.
Return the preorder traversal of a binary tree using recursion or an explicit stack.
Detect whether a linked list contains a cycle using Floyd’s tortoise and hare two-pointer algorithm.
Find the only number that appears once using the XOR operator, while every other number appears exactly twice.