二叉树的遍历
ZXX_1999
这个作者很懒,什么都没留下…
展开
-
102 Invert a Binary Tree (25 分)二叉树的静态写法,静态层序,前序,后序
1102Invert a Binary Tree(25分) The following is from Max Howell @twitter: Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so...原创 2019-11-13 21:38:03 · 179 阅读 · 0 评论 -
1086 Tree Traversals Again (25 分) 给二叉树的前序中序,写出后序
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the s...原创 2019-11-13 17:29:19 · 142 阅读 · 0 评论 -
1020 Tree Traversals (25 分)给中后序写层序
1020Tree Traversals(25分) Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order ...原创 2019-11-12 11:33:46 · 129 阅读 · 0 评论