LeetCode by Java. binary-tree-preorder-traversal

原题描述: Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree{1,#,2,3}, 分析: 先序遍历,遍历顺序为:根...

2017-10-17 17:10:14

阅读数:70

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭