Iterative Inorder traversal of tree

Author: Garvit244

1-100q/94.py

@@ -0,0 +1,46 @@
+'''
+Given a binary tree, return the inorder traversal of its nodes' values.
+
+Example:
+
+Input: [1,null,2,3]
+ 1
+ \
+ 2
+ /
+ 3
+
+Output: [1,3,2]
+
+Follow up: Recursive solution is trivial, could you do it iteratively?
+'''
+
+# Definition for a binary tree node.
+# class TreeNode(object):
+# def __init__(self, x):
+# self.val = x
+# self.left = None
+# self.right = None
+
+class Solution(object):
+ def inorderTraversal(self, root):
+ """
+ :type root: TreeNode
+ :rtype: List[int]
+ """
+ if not root:
+ return []
+ 
+ stack, result = [root], []
+ while stack:
+ if root.left:
+ stack.append(root.left)
+ root = root.left
+ else:
+ node = stack.pop()
+ result.append(node.val)
+ 
+ if node.right:
+ stack.append(node.right)
+ root = node.right
+ return result

README.md

@@ -99,6 +99,7 @@ Python solution of problems from [LeetCode](https://leetcode.com/).
 |98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)| [Python](./1-100q/98.py)|Medium|
 |97|[Interleaving String](https://leetcode.com/problems/interleaving-string/)| [Python](./1-100q/97.py)|Hard|
 |95|[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)| [Python](./1-100q/95.py)|Medium|
+|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)|[Python](./1-100q/94.py)|Medium|
 |93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)| [Python](./1-100q/93.py)|Medium|
 |92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Python](./1-100q/92.py)|Medium|
 |91|[Decode Ways](https://leetcode.com/problems/decode-ways/)| [Python](./1-100q/91.py)|Medium|