kingofstorm7的博客

中序遍历：void InorderTraversal( BinTree BT ){ if( BT ) { InorderTraversal( BT->Left ); /* 此处假设对BT结点的访问就是打印数据 */ printf("%d ", BT->Data); /* 假设数据为整型 */ InorderTraversal

Leetcode145. Binary Tree Postorder Traversal 给定使用数组保存的二叉树，返回其后续遍历Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3},