Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 5d5874c

Browse files
add recursive solution
1 parent 782f044 commit 5d5874c

File tree

1 file changed

+18
-0
lines changed

1 file changed

+18
-0
lines changed

‎Kangli/Trees/inOrderTraversal.py

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
# Definition for a binary tree node.
2+
# class TreeNode(object):
3+
# def __init__(self, x):
4+
# self.val = x
5+
# self.left = None
6+
# self.right = None
7+
8+
class Solution(object):
9+
def inorderTraversal(self, root):
10+
res = []
11+
self.inOrder(root, res)
12+
return res
13+
14+
def inOrder(self, root, res):
15+
if root:
16+
self.inOrder(root.left, res)
17+
res.append(root.val)
18+
self.inOrder(root.right, res)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /