-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbinary-tree-preorder-traversal.js
More file actions
61 lines (59 loc) · 1022 Bytes
/
binary-tree-preorder-traversal.js
File metadata and controls
61 lines (59 loc) · 1022 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/**
* Source: https://leetcode.com/problems/binary-tree-preorder-traversal/
* Tags: [Tree,Stack]
* Level: Medium
* Title: Binary Tree Preorder Traversal
* Auther: @imcoddy
* Content: Given a binary tree, return the preorder traversal of its nodes' values.
*
*
* For example:
* Given binary tree {1,#,2,3},
*
* 1
* \
* 2
* /
* 3
*
*
*
* return [1,2,3].
*
*
* Note: Recursive solution is trivial, could you do it iteratively?
*
*
* Subscribe to see which companies asked this question
*
*
*
*
*
*
*
*
*
*
*
*
* Show Similar Problems
*
*
* (M) Binary Tree Inorder Traversal
*
* (M) Verify Preorder Sequence in Binary Search Tree
*/
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @return {number[]}
*/
var preorderTraversal = function(root) {
};