chapter 23: Two Pointers¶
- Tree - Easy
- 94. Binary Tree inorder traversal
- 95. Unique Binary Search Trees 2
- 96. Unique Binary Search Trees
- 99. Recover Binary Search Tree
- 100. Same Tree
- 105. Contruct binary tree from preorder and inorder traversal
- 106. Construct binary tree from inorder and preorder traversal
- 108. Convert Sorted array to binary search tree
- 109. Convert sorted list to binary search tree
- 110. Balanced binary tree
- 111. Minimum depth of binary tree
- 112. Path sum
- 113. Path sum 2
- 114. Flatten binary tree to linked list
- 116. Populating next right pointers in each node
- 117. populating next right pointers in each node 2
- 124. Binary tree maximum path sum
- 144. Binary tree preorder traversal
- 145. Binary Tree postorder traversal
- 173. Binary Search tree iterator
- 208. Implement trie prefix
- 211. Add and Search word data Structure design
- 226. Invert Binary tree
- 235. Lowest common ancestor of a binary search
- 236. Lowest common ancestor of a binary tree
- 297. Serialize and deserialize binary tree
- 331. Verify preorder serialization of a binary tree
- Tree - Medium
- Tree - Hard