Recursion

Letter Tile Possibilities

leetcode algorithm recursion

Comments Count

Problem description

---

Check Completeness of a Binary Tree (LC958)

binary tree recursion

Comments Count

Solution

---

Flip Equivalent Binary Trees (LC951)

binary tree recursion

Comments Count

Problem description

For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.

---

Print Binary Tree (LC655)

binary tree recursion depth first search leetcode algorithm

Comments Count

Problem description

Print a binary tree in an m*n 2D string array following these rules:

---

Lowest Common Ancestor of a Binary Tree (LC236)

leetcode algorithm binary tree recursion

Comments Count

Problem description

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

---